java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:13:21,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:13:21,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:13:21,282 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:13:21,282 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:13:21,283 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:13:21,284 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:13:21,286 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:13:21,288 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:13:21,289 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:13:21,290 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:13:21,290 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:13:21,291 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:13:21,292 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:13:21,293 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:13:21,294 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:13:21,295 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:13:21,297 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:13:21,299 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:13:21,301 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:13:21,302 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:13:21,303 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:13:21,306 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:13:21,306 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:13:21,306 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:13:21,307 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:13:21,308 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:13:21,309 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:13:21,310 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:13:21,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:13:21,311 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:13:21,312 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:13:21,312 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:13:21,312 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:13:21,314 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:13:21,314 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:13:21,315 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:13:21,328 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:13:21,328 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:13:21,329 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:13:21,329 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:13:21,329 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:13:21,330 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:13:21,330 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:13:21,330 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:13:21,330 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:13:21,330 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:13:21,331 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:13:21,331 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:13:21,331 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:13:21,332 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:13:21,332 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:13:21,332 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:13:21,332 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:13:21,332 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:13:21,332 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:13:21,333 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:13:21,333 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:13:21,333 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:13:21,333 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:13:21,333 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:13:21,334 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:13:21,334 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:13:21,334 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:13:21,334 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:13:21,334 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:13:21,335 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:13:21,335 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:13:21,335 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:13:21,335 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:13:21,335 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:13:21,336 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:13:21,336 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:13:21,336 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:13:21,336 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:13:21,336 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:13:21,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:13:21,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:13:21,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:13:21,385 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:13:21,386 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:13:21,387 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl [2018-12-03 17:13:21,387 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-12-03 17:13:21,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:13:21,459 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:13:21,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:21,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:13:21,460 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:13:21,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,512 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 17:13:21,513 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 17:13:21,513 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 17:13:21,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:21,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:13:21,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:13:21,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:13:21,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:13:21,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:13:21,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:13:21,577 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:13:21,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:13:21,661 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 17:13:21,662 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 17:13:21,662 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 17:13:22,912 INFO L272 CfgBuilder]: Using library mode [2018-12-03 17:13:22,912 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:13:22,913 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:22 BoogieIcfgContainer [2018-12-03 17:13:22,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:13:22,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:13:22,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:13:22,918 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:13:22,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/2) ... [2018-12-03 17:13:22,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5525ee13 and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:13:22, skipping insertion in model container [2018-12-03 17:13:22,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:22" (2/2) ... [2018-12-03 17:13:22,922 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-12-03 17:13:22,933 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:13:22,942 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-12-03 17:13:22,963 INFO L257 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2018-12-03 17:13:23,001 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:13:23,002 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:13:23,002 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:13:23,002 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:13:23,002 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:13:23,002 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:13:23,003 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:13:23,003 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:13:23,027 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-12-03 17:13:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:13:23,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:23,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 17:13:23,040 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:23,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:23,048 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-12-03 17:13:23,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:23,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:23,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:23,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:23,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:23,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:23,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:23,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:23,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:13:23,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:13:23,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:13:23,507 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-12-03 17:13:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:25,122 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-12-03 17:13:25,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:13:25,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 17:13:25,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:25,143 INFO L225 Difference]: With dead ends: 142 [2018-12-03 17:13:25,143 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 17:13:25,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:13:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 17:13:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-12-03 17:13:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 17:13:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-12-03 17:13:25,211 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-12-03 17:13:25,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:25,213 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-12-03 17:13:25,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:13:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-12-03 17:13:25,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:13:25,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:25,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 17:13:25,217 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:25,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:25,219 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-12-03 17:13:25,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:25,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:25,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:25,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:25,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:25,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:25,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:25,365 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:25,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:13:25,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:13:25,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:13:25,368 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-12-03 17:13:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:27,202 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-12-03 17:13:27,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:13:27,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 17:13:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:27,208 INFO L225 Difference]: With dead ends: 241 [2018-12-03 17:13:27,208 INFO L226 Difference]: Without dead ends: 237 [2018-12-03 17:13:27,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-12-03 17:13:27,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-12-03 17:13:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 17:13:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-12-03 17:13:27,241 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-12-03 17:13:27,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:27,242 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-12-03 17:13:27,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:13:27,242 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-12-03 17:13:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:13:27,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:27,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 17:13:27,245 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:27,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:27,245 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-12-03 17:13:27,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:27,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:27,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:27,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:27,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:27,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:27,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:27,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:27,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:13:27,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:13:27,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:13:27,387 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-12-03 17:13:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:28,610 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-12-03 17:13:28,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:13:28,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 17:13:28,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:28,616 INFO L225 Difference]: With dead ends: 269 [2018-12-03 17:13:28,616 INFO L226 Difference]: Without dead ends: 265 [2018-12-03 17:13:28,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-12-03 17:13:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-12-03 17:13:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 17:13:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-12-03 17:13:28,661 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-12-03 17:13:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:28,661 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-12-03 17:13:28,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:13:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-12-03 17:13:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:28,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:28,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:28,664 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:28,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-12-03 17:13:28,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:28,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:28,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:28,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:28,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:28,813 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:28,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:28,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:28,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:28,814 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-12-03 17:13:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:33,385 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-12-03 17:13:33,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:13:33,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:13:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:33,392 INFO L225 Difference]: With dead ends: 790 [2018-12-03 17:13:33,392 INFO L226 Difference]: Without dead ends: 629 [2018-12-03 17:13:33,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:13:33,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-12-03 17:13:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-12-03 17:13:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-03 17:13:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-12-03 17:13:33,443 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-12-03 17:13:33,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:33,443 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-12-03 17:13:33,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:33,443 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-12-03 17:13:33,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:33,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:33,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:33,446 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:33,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:33,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-12-03 17:13:33,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:33,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:33,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:33,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:33,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:33,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:33,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:33,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:33,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:33,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:33,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:33,646 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-12-03 17:13:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:36,615 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-12-03 17:13:36,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:13:36,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:13:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:36,622 INFO L225 Difference]: With dead ends: 634 [2018-12-03 17:13:36,622 INFO L226 Difference]: Without dead ends: 628 [2018-12-03 17:13:36,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:13:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-12-03 17:13:36,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-12-03 17:13:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-12-03 17:13:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-12-03 17:13:36,682 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-12-03 17:13:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:36,682 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-12-03 17:13:36,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-12-03 17:13:36,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:36,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:36,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:36,686 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:36,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:36,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-12-03 17:13:36,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:36,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:36,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:36,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:36,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:36,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:36,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:36,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:36,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:36,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:36,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:36,836 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-12-03 17:13:38,396 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:13:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:40,652 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-12-03 17:13:40,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:13:40,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:13:40,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:40,656 INFO L225 Difference]: With dead ends: 768 [2018-12-03 17:13:40,656 INFO L226 Difference]: Without dead ends: 537 [2018-12-03 17:13:40,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:13:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-03 17:13:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-12-03 17:13:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-12-03 17:13:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-12-03 17:13:40,712 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-12-03 17:13:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:40,713 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-12-03 17:13:40,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-12-03 17:13:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:40,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:40,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:40,715 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:40,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:40,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-12-03 17:13:40,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:40,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:40,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:40,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:40,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:40,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:40,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:40,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:40,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:40,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:40,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:40,857 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-12-03 17:13:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:43,439 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-12-03 17:13:43,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:13:43,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:13:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:43,445 INFO L225 Difference]: With dead ends: 1145 [2018-12-03 17:13:43,445 INFO L226 Difference]: Without dead ends: 812 [2018-12-03 17:13:43,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:13:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-12-03 17:13:43,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-12-03 17:13:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-12-03 17:13:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-12-03 17:13:43,513 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-12-03 17:13:43,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:43,513 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-12-03 17:13:43,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-12-03 17:13:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:43,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:43,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:43,516 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:43,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:43,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-12-03 17:13:43,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:43,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:43,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:43,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:43,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:43,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:43,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:43,616 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:43,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:43,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:43,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:43,618 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-12-03 17:13:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:45,784 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-12-03 17:13:45,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:13:45,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:13:45,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:45,791 INFO L225 Difference]: With dead ends: 877 [2018-12-03 17:13:45,791 INFO L226 Difference]: Without dead ends: 871 [2018-12-03 17:13:45,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:13:45,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-12-03 17:13:45,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-12-03 17:13:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-12-03 17:13:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-12-03 17:13:45,879 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-12-03 17:13:45,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:45,879 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-12-03 17:13:45,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-12-03 17:13:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:45,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:45,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:45,881 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:45,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:45,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-12-03 17:13:45,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:45,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:45,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:45,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:45,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:46,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:46,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:46,045 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:46,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:46,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:46,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:46,046 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-12-03 17:13:48,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:48,230 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-12-03 17:13:48,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:13:48,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:13:48,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:48,235 INFO L225 Difference]: With dead ends: 1049 [2018-12-03 17:13:48,236 INFO L226 Difference]: Without dead ends: 818 [2018-12-03 17:13:48,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:13:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-12-03 17:13:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-12-03 17:13:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-12-03 17:13:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-12-03 17:13:48,342 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-12-03 17:13:48,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:48,343 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-12-03 17:13:48,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:48,343 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-12-03 17:13:48,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:48,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:48,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:48,345 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:48,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:48,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-12-03 17:13:48,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:48,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:48,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:48,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:48,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:48,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:48,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:48,465 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:48,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:48,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:48,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:48,466 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-12-03 17:13:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:50,142 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-12-03 17:13:50,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:13:50,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:13:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:50,148 INFO L225 Difference]: With dead ends: 733 [2018-12-03 17:13:50,148 INFO L226 Difference]: Without dead ends: 727 [2018-12-03 17:13:50,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:13:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-12-03 17:13:50,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-12-03 17:13:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-12-03 17:13:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-12-03 17:13:50,267 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-12-03 17:13:50,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:50,268 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-12-03 17:13:50,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-12-03 17:13:50,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:50,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:50,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:50,272 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:50,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:50,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-12-03 17:13:50,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:50,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:50,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:50,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:50,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:50,635 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-12-03 17:13:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:50,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:50,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:50,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:50,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:50,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:50,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:50,665 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-12-03 17:13:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:53,944 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-12-03 17:13:53,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:13:53,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:13:53,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:53,953 INFO L225 Difference]: With dead ends: 1329 [2018-12-03 17:13:53,954 INFO L226 Difference]: Without dead ends: 1323 [2018-12-03 17:13:53,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:13:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-12-03 17:13:54,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-12-03 17:13:54,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-03 17:13:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-12-03 17:13:54,118 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-12-03 17:13:54,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:54,119 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-12-03 17:13:54,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-12-03 17:13:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:54,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:54,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:54,120 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:54,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:54,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-12-03 17:13:54,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:54,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:54,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:54,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:54,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:54,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:54,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:54,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:54,221 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:54,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:54,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:54,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:54,223 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-12-03 17:13:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:56,576 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-12-03 17:13:56,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:13:56,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:13:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:56,584 INFO L225 Difference]: With dead ends: 1268 [2018-12-03 17:13:56,585 INFO L226 Difference]: Without dead ends: 1262 [2018-12-03 17:13:56,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:13:56,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-12-03 17:13:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-12-03 17:13:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-12-03 17:13:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-12-03 17:13:56,752 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-12-03 17:13:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:56,752 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-12-03 17:13:56,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-12-03 17:13:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:56,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:56,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:56,755 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:56,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:56,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-12-03 17:13:56,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:56,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:56,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:56,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:56,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:56,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:56,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:56,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:56,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:56,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:56,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:56,883 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-12-03 17:13:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:59,491 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-12-03 17:13:59,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:13:59,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:13:59,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:59,501 INFO L225 Difference]: With dead ends: 1367 [2018-12-03 17:13:59,501 INFO L226 Difference]: Without dead ends: 1361 [2018-12-03 17:13:59,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:13:59,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-12-03 17:13:59,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-12-03 17:13:59,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-12-03 17:13:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-12-03 17:13:59,676 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-12-03 17:13:59,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:59,676 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-12-03 17:13:59,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-12-03 17:13:59,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:59,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:59,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:59,678 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:59,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:59,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-12-03 17:13:59,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:59,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:59,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:59,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:59,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:59,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:59,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:59,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:59,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:59,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:59,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:59,782 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-12-03 17:14:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:03,091 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-12-03 17:14:03,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:14:03,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:14:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:03,101 INFO L225 Difference]: With dead ends: 1373 [2018-12-03 17:14:03,101 INFO L226 Difference]: Without dead ends: 1367 [2018-12-03 17:14:03,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:14:03,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-12-03 17:14:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-12-03 17:14:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-12-03 17:14:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-12-03 17:14:03,340 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-12-03 17:14:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:03,341 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-12-03 17:14:03,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-12-03 17:14:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:03,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:03,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:03,343 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:03,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:03,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-12-03 17:14:03,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:03,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:03,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:03,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:03,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:03,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:03,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:14:03,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:03,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:03,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:03,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:03,475 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-12-03 17:14:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:05,569 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-12-03 17:14:05,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:14:05,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:14:05,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:05,577 INFO L225 Difference]: With dead ends: 1526 [2018-12-03 17:14:05,578 INFO L226 Difference]: Without dead ends: 1520 [2018-12-03 17:14:05,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:14:05,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-12-03 17:14:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-12-03 17:14:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-12-03 17:14:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-12-03 17:14:05,826 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-12-03 17:14:05,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:05,826 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-12-03 17:14:05,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-12-03 17:14:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:05,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:05,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:05,828 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:05,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:05,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-12-03 17:14:05,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:05,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:05,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:05,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:05,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:06,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:06,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:14:06,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:06,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:06,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:06,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:06,068 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-12-03 17:14:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:08,385 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-12-03 17:14:08,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:14:08,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:14:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:08,393 INFO L225 Difference]: With dead ends: 1548 [2018-12-03 17:14:08,393 INFO L226 Difference]: Without dead ends: 1542 [2018-12-03 17:14:08,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:14:08,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-12-03 17:14:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-12-03 17:14:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-12-03 17:14:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-12-03 17:14:08,601 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-12-03 17:14:08,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:08,601 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-12-03 17:14:08,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-12-03 17:14:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:08,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:08,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:08,604 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:08,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:08,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-12-03 17:14:08,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:08,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:08,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:08,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:08,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:08,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:08,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:14:08,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:08,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:08,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:08,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:08,791 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-12-03 17:14:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:11,079 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-12-03 17:14:11,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:14:11,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:14:11,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:11,088 INFO L225 Difference]: With dead ends: 1575 [2018-12-03 17:14:11,088 INFO L226 Difference]: Without dead ends: 1569 [2018-12-03 17:14:11,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:14:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-12-03 17:14:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-12-03 17:14:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-12-03 17:14:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-12-03 17:14:11,350 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-12-03 17:14:11,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:11,351 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-12-03 17:14:11,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-12-03 17:14:11,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:11,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:11,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:11,352 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:11,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:11,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-12-03 17:14:11,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:11,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:11,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:11,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:11,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:11,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:11,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:14:11,442 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:11,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:11,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:11,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:11,443 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-12-03 17:14:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:13,709 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-12-03 17:14:13,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:14:13,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:14:13,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:13,720 INFO L225 Difference]: With dead ends: 1597 [2018-12-03 17:14:13,720 INFO L226 Difference]: Without dead ends: 1591 [2018-12-03 17:14:13,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:14:13,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-12-03 17:14:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-12-03 17:14:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-12-03 17:14:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-12-03 17:14:13,980 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-12-03 17:14:13,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:13,981 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-12-03 17:14:13,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-12-03 17:14:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:13,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:13,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:13,983 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:13,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:13,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-12-03 17:14:13,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:13,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:13,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:13,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:13,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:14,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:14,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:14:14,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:14,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:14,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:14,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:14,129 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-12-03 17:14:16,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:16,253 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-12-03 17:14:16,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:14:16,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:14:16,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:16,264 INFO L225 Difference]: With dead ends: 1726 [2018-12-03 17:14:16,264 INFO L226 Difference]: Without dead ends: 1720 [2018-12-03 17:14:16,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:14:16,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-12-03 17:14:16,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-12-03 17:14:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-12-03 17:14:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-12-03 17:14:16,607 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-12-03 17:14:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:16,607 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-12-03 17:14:16,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-12-03 17:14:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:16,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:16,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:16,609 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:16,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:16,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-12-03 17:14:16,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:16,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:16,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:16,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:16,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:16,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:16,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:16,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:14:16,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:16,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:16,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:16,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:16,766 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-12-03 17:14:19,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:19,298 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-12-03 17:14:19,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:14:19,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:14:19,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:19,305 INFO L225 Difference]: With dead ends: 1758 [2018-12-03 17:14:19,305 INFO L226 Difference]: Without dead ends: 1752 [2018-12-03 17:14:19,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:14:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-12-03 17:14:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-12-03 17:14:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-12-03 17:14:19,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-12-03 17:14:19,633 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-12-03 17:14:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:19,633 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-12-03 17:14:19,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-12-03 17:14:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:19,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:19,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:19,635 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:19,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:19,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-12-03 17:14:19,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:19,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:19,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:19,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:19,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:19,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:19,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:14:19,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:19,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:19,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:19,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:19,731 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-12-03 17:14:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:22,607 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-12-03 17:14:22,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:14:22,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:14:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:22,615 INFO L225 Difference]: With dead ends: 1867 [2018-12-03 17:14:22,615 INFO L226 Difference]: Without dead ends: 1861 [2018-12-03 17:14:22,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:14:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-12-03 17:14:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-12-03 17:14:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-12-03 17:14:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-12-03 17:14:23,028 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-12-03 17:14:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:23,028 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-12-03 17:14:23,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:23,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-12-03 17:14:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:23,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:23,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:23,030 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:23,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:23,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-12-03 17:14:23,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:23,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:23,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:23,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:23,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:23,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:23,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:14:23,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:23,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:23,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:23,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:23,155 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-12-03 17:14:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:26,226 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-12-03 17:14:26,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:14:26,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:14:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:26,234 INFO L225 Difference]: With dead ends: 1968 [2018-12-03 17:14:26,234 INFO L226 Difference]: Without dead ends: 1962 [2018-12-03 17:14:26,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:14:26,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-12-03 17:14:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-12-03 17:14:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-12-03 17:14:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-12-03 17:14:26,788 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-12-03 17:14:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:26,789 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-12-03 17:14:26,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:26,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-12-03 17:14:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:26,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:26,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:26,790 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:26,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:26,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-12-03 17:14:26,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:26,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:26,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:26,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:26,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:26,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:26,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:14:26,886 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:26,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:26,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:26,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:26,887 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-12-03 17:14:29,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:29,694 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-12-03 17:14:29,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:14:29,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:14:29,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:29,701 INFO L225 Difference]: With dead ends: 2001 [2018-12-03 17:14:29,701 INFO L226 Difference]: Without dead ends: 1995 [2018-12-03 17:14:29,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:14:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-12-03 17:14:30,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-12-03 17:14:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-12-03 17:14:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-12-03 17:14:30,246 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-12-03 17:14:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:30,246 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-12-03 17:14:30,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:30,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-12-03 17:14:30,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:30,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:30,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:30,248 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:30,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:30,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-12-03 17:14:30,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:30,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:30,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:30,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:30,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:30,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:30,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:14:30,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:30,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:30,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:30,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:30,346 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-12-03 17:14:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:32,794 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-12-03 17:14:32,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:14:32,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:14:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:32,798 INFO L225 Difference]: With dead ends: 1708 [2018-12-03 17:14:32,798 INFO L226 Difference]: Without dead ends: 1702 [2018-12-03 17:14:32,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:14:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-12-03 17:14:33,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-12-03 17:14:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-12-03 17:14:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-12-03 17:14:33,258 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-12-03 17:14:33,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:33,258 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-12-03 17:14:33,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-12-03 17:14:33,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:33,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:33,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:33,260 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:33,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:33,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-12-03 17:14:33,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:33,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:33,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:33,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:33,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:33,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:33,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:14:33,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:33,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:33,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:33,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:33,368 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-12-03 17:14:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:36,793 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-12-03 17:14:36,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:14:36,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:14:36,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:36,798 INFO L225 Difference]: With dead ends: 2402 [2018-12-03 17:14:36,798 INFO L226 Difference]: Without dead ends: 2396 [2018-12-03 17:14:36,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:14:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-12-03 17:14:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-12-03 17:14:37,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-12-03 17:14:37,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-12-03 17:14:37,380 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-12-03 17:14:37,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:37,380 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-12-03 17:14:37,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-12-03 17:14:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:37,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:37,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:37,382 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:37,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:37,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-12-03 17:14:37,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:37,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:37,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:37,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:37,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:37,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:37,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:14:37,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:37,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:37,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:37,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:37,524 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-12-03 17:14:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:40,796 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-12-03 17:14:40,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:14:40,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:14:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:40,801 INFO L225 Difference]: With dead ends: 2274 [2018-12-03 17:14:40,801 INFO L226 Difference]: Without dead ends: 2268 [2018-12-03 17:14:40,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:14:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-12-03 17:14:41,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-12-03 17:14:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 17:14:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-12-03 17:14:41,375 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-12-03 17:14:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:41,375 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-12-03 17:14:41,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-12-03 17:14:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:41,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:41,377 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-03 17:14:41,377 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:41,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:41,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-12-03 17:14:41,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:41,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:41,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:41,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:41,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:41,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:41,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:14:41,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:41,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:14:41,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:14:41,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:14:41,487 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-12-03 17:14:42,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:42,439 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-12-03 17:14:42,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:14:42,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 17:14:42,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:42,441 INFO L225 Difference]: With dead ends: 2170 [2018-12-03 17:14:42,441 INFO L226 Difference]: Without dead ends: 1253 [2018-12-03 17:14:42,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:14:42,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-12-03 17:14:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-12-03 17:14:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-12-03 17:14:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-12-03 17:14:42,908 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-12-03 17:14:42,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:42,908 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-12-03 17:14:42,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:14:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-12-03 17:14:42,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:42,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:42,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:42,909 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:42,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:42,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-12-03 17:14:42,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:42,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:42,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:42,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:42,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:43,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:43,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:14:43,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:43,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:43,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:43,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:43,050 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-12-03 17:14:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:46,929 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-12-03 17:14:46,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:14:46,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:14:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:46,933 INFO L225 Difference]: With dead ends: 2095 [2018-12-03 17:14:46,933 INFO L226 Difference]: Without dead ends: 2093 [2018-12-03 17:14:46,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:14:46,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-12-03 17:14:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-12-03 17:14:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-12-03 17:14:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-12-03 17:14:47,484 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-12-03 17:14:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:47,484 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-12-03 17:14:47,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-12-03 17:14:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:47,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:47,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:47,485 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:47,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:47,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-12-03 17:14:47,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:47,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:47,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:47,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:47,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:47,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:47,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:14:47,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:47,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:47,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:47,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:47,693 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. [2018-12-03 17:14:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:51,525 INFO L93 Difference]: Finished difference Result 1994 states and 5988 transitions. [2018-12-03 17:14:51,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:14:51,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:14:51,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:51,529 INFO L225 Difference]: With dead ends: 1994 [2018-12-03 17:14:51,529 INFO L226 Difference]: Without dead ends: 1988 [2018-12-03 17:14:51,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:14:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-12-03 17:14:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1152. [2018-12-03 17:14:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-12-03 17:14:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4099 transitions. [2018-12-03 17:14:52,075 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4099 transitions. Word has length 8 [2018-12-03 17:14:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:52,075 INFO L480 AbstractCegarLoop]: Abstraction has 1152 states and 4099 transitions. [2018-12-03 17:14:52,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4099 transitions. [2018-12-03 17:14:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:52,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:52,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:52,077 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:52,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:52,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1867882049, now seen corresponding path program 1 times [2018-12-03 17:14:52,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:52,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:52,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:52,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:52,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:14:52,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:52,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:52,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:52,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:52,303 INFO L87 Difference]: Start difference. First operand 1152 states and 4099 transitions. Second operand 8 states. [2018-12-03 17:14:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:56,621 INFO L93 Difference]: Finished difference Result 2160 states and 6516 transitions. [2018-12-03 17:14:56,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:14:56,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:14:56,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:56,626 INFO L225 Difference]: With dead ends: 2160 [2018-12-03 17:14:56,626 INFO L226 Difference]: Without dead ends: 2154 [2018-12-03 17:14:56,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:14:56,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2018-12-03 17:14:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1174. [2018-12-03 17:14:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-12-03 17:14:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4164 transitions. [2018-12-03 17:14:57,226 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4164 transitions. Word has length 8 [2018-12-03 17:14:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:57,227 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 4164 transitions. [2018-12-03 17:14:57,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4164 transitions. [2018-12-03 17:14:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:57,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:57,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:57,228 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:57,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:57,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1867881922, now seen corresponding path program 1 times [2018-12-03 17:14:57,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:57,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:57,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:57,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:57,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:57,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:57,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:14:57,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:57,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:57,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:57,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:57,382 INFO L87 Difference]: Start difference. First operand 1174 states and 4164 transitions. Second operand 8 states. [2018-12-03 17:15:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:01,633 INFO L93 Difference]: Finished difference Result 2094 states and 6271 transitions. [2018-12-03 17:15:01,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:15:01,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:15:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:01,637 INFO L225 Difference]: With dead ends: 2094 [2018-12-03 17:15:01,637 INFO L226 Difference]: Without dead ends: 2088 [2018-12-03 17:15:01,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:15:01,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-12-03 17:15:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1153. [2018-12-03 17:15:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-12-03 17:15:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 4095 transitions. [2018-12-03 17:15:02,337 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 4095 transitions. Word has length 8 [2018-12-03 17:15:02,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:02,337 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 4095 transitions. [2018-12-03 17:15:02,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:02,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 4095 transitions. [2018-12-03 17:15:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:15:02,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:02,338 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-03 17:15:02,338 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:02,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:02,338 INFO L82 PathProgramCache]: Analyzing trace with hash -896988374, now seen corresponding path program 1 times [2018-12-03 17:15:02,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:02,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:02,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:02,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:02,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:02,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:02,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:15:02,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:02,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:15:02,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:15:02,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:15:02,370 INFO L87 Difference]: Start difference. First operand 1153 states and 4095 transitions. Second operand 4 states. [2018-12-03 17:15:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:03,375 INFO L93 Difference]: Finished difference Result 1929 states and 6604 transitions. [2018-12-03 17:15:03,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:15:03,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 17:15:03,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:03,379 INFO L225 Difference]: With dead ends: 1929 [2018-12-03 17:15:03,379 INFO L226 Difference]: Without dead ends: 1400 [2018-12-03 17:15:03,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:15:03,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-12-03 17:15:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1083. [2018-12-03 17:15:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-12-03 17:15:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3765 transitions. [2018-12-03 17:15:04,018 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 3765 transitions. Word has length 8 [2018-12-03 17:15:04,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:04,019 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 3765 transitions. [2018-12-03 17:15:04,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:15:04,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 3765 transitions. [2018-12-03 17:15:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:15:04,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:04,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:04,020 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:04,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:04,021 INFO L82 PathProgramCache]: Analyzing trace with hash -896379114, now seen corresponding path program 1 times [2018-12-03 17:15:04,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:04,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:04,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:04,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:04,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:04,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:04,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:15:04,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:04,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:04,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:04,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:04,155 INFO L87 Difference]: Start difference. First operand 1083 states and 3765 transitions. Second operand 8 states. [2018-12-03 17:15:07,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:07,910 INFO L93 Difference]: Finished difference Result 2276 states and 6948 transitions. [2018-12-03 17:15:07,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:15:07,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:15:07,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:07,915 INFO L225 Difference]: With dead ends: 2276 [2018-12-03 17:15:07,915 INFO L226 Difference]: Without dead ends: 2270 [2018-12-03 17:15:07,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:15:07,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2018-12-03 17:15:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1266. [2018-12-03 17:15:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-12-03 17:15:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4418 transitions. [2018-12-03 17:15:08,657 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4418 transitions. Word has length 8 [2018-12-03 17:15:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:08,658 INFO L480 AbstractCegarLoop]: Abstraction has 1266 states and 4418 transitions. [2018-12-03 17:15:08,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4418 transitions. [2018-12-03 17:15:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:15:08,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:08,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:08,659 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:08,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:08,660 INFO L82 PathProgramCache]: Analyzing trace with hash -896379111, now seen corresponding path program 1 times [2018-12-03 17:15:08,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:08,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:08,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:08,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:08,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:08,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:08,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:15:08,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:08,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:08,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:08,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:08,766 INFO L87 Difference]: Start difference. First operand 1266 states and 4418 transitions. Second operand 8 states. [2018-12-03 17:15:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:13,197 INFO L93 Difference]: Finished difference Result 2425 states and 7363 transitions. [2018-12-03 17:15:13,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:15:13,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:15:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:13,202 INFO L225 Difference]: With dead ends: 2425 [2018-12-03 17:15:13,202 INFO L226 Difference]: Without dead ends: 2419 [2018-12-03 17:15:13,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:15:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2018-12-03 17:15:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1373. [2018-12-03 17:15:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2018-12-03 17:15:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 4822 transitions. [2018-12-03 17:15:14,135 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 4822 transitions. Word has length 8 [2018-12-03 17:15:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:14,135 INFO L480 AbstractCegarLoop]: Abstraction has 1373 states and 4822 transitions. [2018-12-03 17:15:14,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 4822 transitions. [2018-12-03 17:15:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:15:14,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:14,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:14,137 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:14,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:14,137 INFO L82 PathProgramCache]: Analyzing trace with hash -881085998, now seen corresponding path program 1 times [2018-12-03 17:15:14,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:14,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:14,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:14,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:14,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:14,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:14,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:15:14,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:14,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:14,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:14,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:14,422 INFO L87 Difference]: Start difference. First operand 1373 states and 4822 transitions. Second operand 8 states. [2018-12-03 17:15:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:18,996 INFO L93 Difference]: Finished difference Result 2278 states and 6952 transitions. [2018-12-03 17:15:18,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:15:18,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:15:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:19,003 INFO L225 Difference]: With dead ends: 2278 [2018-12-03 17:15:19,003 INFO L226 Difference]: Without dead ends: 2272 [2018-12-03 17:15:19,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:15:19,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-12-03 17:15:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1421. [2018-12-03 17:15:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2018-12-03 17:15:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 4963 transitions. [2018-12-03 17:15:19,986 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 4963 transitions. Word has length 8 [2018-12-03 17:15:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:19,987 INFO L480 AbstractCegarLoop]: Abstraction has 1421 states and 4963 transitions. [2018-12-03 17:15:19,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 4963 transitions. [2018-12-03 17:15:19,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:15:19,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:19,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:19,988 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:19,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:19,988 INFO L82 PathProgramCache]: Analyzing trace with hash -881086125, now seen corresponding path program 1 times [2018-12-03 17:15:19,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:19,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:19,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:19,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:19,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:20,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:20,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:15:20,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:20,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:20,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:20,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:20,081 INFO L87 Difference]: Start difference. First operand 1421 states and 4963 transitions. Second operand 8 states. [2018-12-03 17:15:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:24,385 INFO L93 Difference]: Finished difference Result 2233 states and 6848 transitions. [2018-12-03 17:15:24,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:15:24,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:15:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:24,389 INFO L225 Difference]: With dead ends: 2233 [2018-12-03 17:15:24,389 INFO L226 Difference]: Without dead ends: 2227 [2018-12-03 17:15:24,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:15:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-12-03 17:15:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1411. [2018-12-03 17:15:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-12-03 17:15:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 4926 transitions. [2018-12-03 17:15:25,355 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 4926 transitions. Word has length 8 [2018-12-03 17:15:25,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:25,355 INFO L480 AbstractCegarLoop]: Abstraction has 1411 states and 4926 transitions. [2018-12-03 17:15:25,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 4926 transitions. [2018-12-03 17:15:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:15:25,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:25,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:25,357 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:25,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:25,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099334, now seen corresponding path program 1 times [2018-12-03 17:15:25,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:25,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:25,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:25,876 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-12-03 17:15:26,135 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-12-03 17:15:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:26,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:26,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:15:26,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:26,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:26,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:26,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:26,190 INFO L87 Difference]: Start difference. First operand 1411 states and 4926 transitions. Second operand 8 states. [2018-12-03 17:15:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:30,941 INFO L93 Difference]: Finished difference Result 2558 states and 7836 transitions. [2018-12-03 17:15:30,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:15:30,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:15:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:30,946 INFO L225 Difference]: With dead ends: 2558 [2018-12-03 17:15:30,946 INFO L226 Difference]: Without dead ends: 2552 [2018-12-03 17:15:30,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:15:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-12-03 17:15:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1471. [2018-12-03 17:15:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-12-03 17:15:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 5183 transitions. [2018-12-03 17:15:31,928 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 5183 transitions. Word has length 8 [2018-12-03 17:15:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:31,929 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 5183 transitions. [2018-12-03 17:15:31,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 5183 transitions. [2018-12-03 17:15:31,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:15:31,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:31,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:31,931 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:31,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:31,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099337, now seen corresponding path program 1 times [2018-12-03 17:15:31,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:31,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:31,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:31,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:31,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:32,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:32,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:15:32,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:32,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:32,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:32,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:32,055 INFO L87 Difference]: Start difference. First operand 1471 states and 5183 transitions. Second operand 8 states. [2018-12-03 17:15:32,189 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-12-03 17:15:37,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:37,094 INFO L93 Difference]: Finished difference Result 2703 states and 8278 transitions. [2018-12-03 17:15:37,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:15:37,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:15:37,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:37,100 INFO L225 Difference]: With dead ends: 2703 [2018-12-03 17:15:37,100 INFO L226 Difference]: Without dead ends: 2697 [2018-12-03 17:15:37,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:15:37,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2018-12-03 17:15:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1480. [2018-12-03 17:15:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-12-03 17:15:38,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5200 transitions. [2018-12-03 17:15:38,179 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5200 transitions. Word has length 8 [2018-12-03 17:15:38,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:38,179 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5200 transitions. [2018-12-03 17:15:38,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5200 transitions. [2018-12-03 17:15:38,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:15:38,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:38,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:38,181 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:38,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:38,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629971, now seen corresponding path program 1 times [2018-12-03 17:15:38,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:38,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:38,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:38,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:38,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:38,670 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-12-03 17:15:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:38,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:38,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:15:38,730 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:38,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:38,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:38,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:38,731 INFO L87 Difference]: Start difference. First operand 1480 states and 5200 transitions. Second operand 8 states. [2018-12-03 17:15:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:44,026 INFO L93 Difference]: Finished difference Result 2674 states and 8171 transitions. [2018-12-03 17:15:44,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:15:44,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:15:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:44,033 INFO L225 Difference]: With dead ends: 2674 [2018-12-03 17:15:44,033 INFO L226 Difference]: Without dead ends: 2668 [2018-12-03 17:15:44,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:15:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2018-12-03 17:15:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 1480. [2018-12-03 17:15:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-12-03 17:15:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5196 transitions. [2018-12-03 17:15:45,127 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5196 transitions. Word has length 8 [2018-12-03 17:15:45,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:45,127 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5196 transitions. [2018-12-03 17:15:45,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5196 transitions. [2018-12-03 17:15:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:15:45,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:45,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:45,129 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:45,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:45,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629974, now seen corresponding path program 1 times [2018-12-03 17:15:45,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:45,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:45,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:45,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:45,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:45,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:45,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:15:45,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:45,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:45,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:45,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:45,239 INFO L87 Difference]: Start difference. First operand 1480 states and 5196 transitions. Second operand 8 states. [2018-12-03 17:15:50,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:50,811 INFO L93 Difference]: Finished difference Result 2722 states and 8299 transitions. [2018-12-03 17:15:50,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:15:50,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:15:50,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:50,816 INFO L225 Difference]: With dead ends: 2722 [2018-12-03 17:15:50,816 INFO L226 Difference]: Without dead ends: 2716 [2018-12-03 17:15:50,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:15:50,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-12-03 17:15:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 1462. [2018-12-03 17:15:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2018-12-03 17:15:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 5124 transitions. [2018-12-03 17:15:51,949 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 5124 transitions. Word has length 8 [2018-12-03 17:15:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:51,949 INFO L480 AbstractCegarLoop]: Abstraction has 1462 states and 5124 transitions. [2018-12-03 17:15:51,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 5124 transitions. [2018-12-03 17:15:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:15:51,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:51,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:51,950 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:51,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:51,950 INFO L82 PathProgramCache]: Analyzing trace with hash 278041308, now seen corresponding path program 1 times [2018-12-03 17:15:51,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:51,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:51,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:51,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:51,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:52,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:52,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:15:52,023 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:52,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:52,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:52,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:52,024 INFO L87 Difference]: Start difference. First operand 1462 states and 5124 transitions. Second operand 8 states. [2018-12-03 17:15:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:57,103 INFO L93 Difference]: Finished difference Result 2962 states and 9218 transitions. [2018-12-03 17:15:57,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:15:57,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:15:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:57,109 INFO L225 Difference]: With dead ends: 2962 [2018-12-03 17:15:57,109 INFO L226 Difference]: Without dead ends: 2956 [2018-12-03 17:15:57,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:15:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-12-03 17:15:58,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1776. [2018-12-03 17:15:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-12-03 17:15:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 6236 transitions. [2018-12-03 17:15:58,467 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 6236 transitions. Word has length 9 [2018-12-03 17:15:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:58,467 INFO L480 AbstractCegarLoop]: Abstraction has 1776 states and 6236 transitions. [2018-12-03 17:15:58,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 6236 transitions. [2018-12-03 17:15:58,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:15:58,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:58,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:58,468 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:58,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:58,469 INFO L82 PathProgramCache]: Analyzing trace with hash 278041683, now seen corresponding path program 1 times [2018-12-03 17:15:58,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:58,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:58,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:58,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:58,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:58,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:58,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:58,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:15:58,754 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:58,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:58,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:58,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:58,754 INFO L87 Difference]: Start difference. First operand 1776 states and 6236 transitions. Second operand 8 states. [2018-12-03 17:16:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:03,951 INFO L93 Difference]: Finished difference Result 2948 states and 9162 transitions. [2018-12-03 17:16:03,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:16:03,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:16:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:03,958 INFO L225 Difference]: With dead ends: 2948 [2018-12-03 17:16:03,958 INFO L226 Difference]: Without dead ends: 2942 [2018-12-03 17:16:03,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:16:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2018-12-03 17:16:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1772. [2018-12-03 17:16:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-12-03 17:16:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 6220 transitions. [2018-12-03 17:16:05,475 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 6220 transitions. Word has length 9 [2018-12-03 17:16:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:05,475 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 6220 transitions. [2018-12-03 17:16:05,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:16:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 6220 transitions. [2018-12-03 17:16:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:16:05,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:05,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:05,476 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:05,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:05,477 INFO L82 PathProgramCache]: Analyzing trace with hash 541105076, now seen corresponding path program 1 times [2018-12-03 17:16:05,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:05,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:05,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:05,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:05,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:05,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:05,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:16:05,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:16:05,578 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:05,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:16:05,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:16:05,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:16:05,579 INFO L87 Difference]: Start difference. First operand 1772 states and 6220 transitions. Second operand 8 states. [2018-12-03 17:16:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:11,649 INFO L93 Difference]: Finished difference Result 3238 states and 9970 transitions. [2018-12-03 17:16:11,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:16:11,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:16:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:11,656 INFO L225 Difference]: With dead ends: 3238 [2018-12-03 17:16:11,657 INFO L226 Difference]: Without dead ends: 3232 [2018-12-03 17:16:11,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:16:11,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2018-12-03 17:16:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1799. [2018-12-03 17:16:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-12-03 17:16:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 6288 transitions. [2018-12-03 17:16:13,196 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 6288 transitions. Word has length 9 [2018-12-03 17:16:13,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:13,196 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 6288 transitions. [2018-12-03 17:16:13,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:16:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 6288 transitions. [2018-12-03 17:16:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:16:13,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:13,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:13,198 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:13,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:13,198 INFO L82 PathProgramCache]: Analyzing trace with hash 541105451, now seen corresponding path program 1 times [2018-12-03 17:16:13,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:13,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:13,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:13,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:13,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:13,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:16:13,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:16:13,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:13,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:16:13,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:16:13,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:16:13,299 INFO L87 Difference]: Start difference. First operand 1799 states and 6288 transitions. Second operand 8 states. [2018-12-03 17:16:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:19,691 INFO L93 Difference]: Finished difference Result 3212 states and 9854 transitions. [2018-12-03 17:16:19,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:16:19,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:16:19,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:19,697 INFO L225 Difference]: With dead ends: 3212 [2018-12-03 17:16:19,698 INFO L226 Difference]: Without dead ends: 3206 [2018-12-03 17:16:19,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:16:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2018-12-03 17:16:21,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 1737. [2018-12-03 17:16:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-12-03 17:16:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 6062 transitions. [2018-12-03 17:16:21,233 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 6062 transitions. Word has length 9 [2018-12-03 17:16:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:21,234 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 6062 transitions. [2018-12-03 17:16:21,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:16:21,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 6062 transitions. [2018-12-03 17:16:21,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:16:21,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:21,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:21,235 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:21,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:21,236 INFO L82 PathProgramCache]: Analyzing trace with hash 825189368, now seen corresponding path program 1 times [2018-12-03 17:16:21,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:21,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:21,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:21,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:21,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:21,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:16:21,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:16:21,328 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:21,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:16:21,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:16:21,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:16:21,329 INFO L87 Difference]: Start difference. First operand 1737 states and 6062 transitions. Second operand 8 states. [2018-12-03 17:16:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:27,151 INFO L93 Difference]: Finished difference Result 3315 states and 10043 transitions. [2018-12-03 17:16:27,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:16:27,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:16:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:27,157 INFO L225 Difference]: With dead ends: 3315 [2018-12-03 17:16:27,158 INFO L226 Difference]: Without dead ends: 3309 [2018-12-03 17:16:27,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:16:27,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2018-12-03 17:16:28,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1985. [2018-12-03 17:16:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-12-03 17:16:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 6886 transitions. [2018-12-03 17:16:28,894 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 6886 transitions. Word has length 9 [2018-12-03 17:16:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:28,894 INFO L480 AbstractCegarLoop]: Abstraction has 1985 states and 6886 transitions. [2018-12-03 17:16:28,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:16:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 6886 transitions. [2018-12-03 17:16:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:16:28,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:28,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:28,896 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:28,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:28,896 INFO L82 PathProgramCache]: Analyzing trace with hash 825189371, now seen corresponding path program 1 times [2018-12-03 17:16:28,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:28,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:28,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:28,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:28,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:28,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:16:28,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:16:28,998 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:28,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:16:28,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:16:28,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:16:28,999 INFO L87 Difference]: Start difference. First operand 1985 states and 6886 transitions. Second operand 8 states. [2018-12-03 17:16:35,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:35,647 INFO L93 Difference]: Finished difference Result 3446 states and 10415 transitions. [2018-12-03 17:16:35,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:16:35,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:16:35,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:35,654 INFO L225 Difference]: With dead ends: 3446 [2018-12-03 17:16:35,654 INFO L226 Difference]: Without dead ends: 3440 [2018-12-03 17:16:35,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:16:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2018-12-03 17:16:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 1927. [2018-12-03 17:16:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2018-12-03 17:16:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 6663 transitions. [2018-12-03 17:16:37,405 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 6663 transitions. Word has length 9 [2018-12-03 17:16:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:37,405 INFO L480 AbstractCegarLoop]: Abstraction has 1927 states and 6663 transitions. [2018-12-03 17:16:37,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:16:37,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 6663 transitions. [2018-12-03 17:16:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:16:37,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:37,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:37,406 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:37,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:37,407 INFO L82 PathProgramCache]: Analyzing trace with hash 832700792, now seen corresponding path program 1 times [2018-12-03 17:16:37,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:37,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:37,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:37,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:37,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:37,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:16:37,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:16:37,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:37,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:16:37,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:16:37,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:16:37,484 INFO L87 Difference]: Start difference. First operand 1927 states and 6663 transitions. Second operand 8 states. [2018-12-03 17:16:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:43,083 INFO L93 Difference]: Finished difference Result 2832 states and 8631 transitions. [2018-12-03 17:16:43,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:16:43,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:16:43,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:43,090 INFO L225 Difference]: With dead ends: 2832 [2018-12-03 17:16:43,090 INFO L226 Difference]: Without dead ends: 2824 [2018-12-03 17:16:43,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:16:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2018-12-03 17:16:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1904. [2018-12-03 17:16:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-12-03 17:16:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 6553 transitions. [2018-12-03 17:16:44,944 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 6553 transitions. Word has length 9 [2018-12-03 17:16:44,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:44,945 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 6553 transitions. [2018-12-03 17:16:44,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:16:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 6553 transitions. [2018-12-03 17:16:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:16:44,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:44,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:44,946 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:44,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:44,947 INFO L82 PathProgramCache]: Analyzing trace with hash -595843680, now seen corresponding path program 1 times [2018-12-03 17:16:44,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:44,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:44,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:44,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:44,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:45,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:16:45,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:16:45,046 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:45,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:16:45,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:16:45,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:16:45,047 INFO L87 Difference]: Start difference. First operand 1904 states and 6553 transitions. Second operand 9 states. [2018-12-03 17:16:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:51,058 INFO L93 Difference]: Finished difference Result 3157 states and 9716 transitions. [2018-12-03 17:16:51,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:16:51,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 17:16:51,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:51,065 INFO L225 Difference]: With dead ends: 3157 [2018-12-03 17:16:51,065 INFO L226 Difference]: Without dead ends: 3151 [2018-12-03 17:16:51,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:16:51,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-12-03 17:16:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 1949. [2018-12-03 17:16:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2018-12-03 17:16:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 6722 transitions. [2018-12-03 17:16:53,028 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 6722 transitions. Word has length 9 [2018-12-03 17:16:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:53,028 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 6722 transitions. [2018-12-03 17:16:53,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:16:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 6722 transitions. [2018-12-03 17:16:53,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:16:53,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:53,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:53,030 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:53,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:53,030 INFO L82 PathProgramCache]: Analyzing trace with hash -595843677, now seen corresponding path program 1 times [2018-12-03 17:16:53,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:53,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:53,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:53,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:53,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:53,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:16:53,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:16:53,136 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:53,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:16:53,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:16:53,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:16:53,137 INFO L87 Difference]: Start difference. First operand 1949 states and 6722 transitions. Second operand 9 states. [2018-12-03 17:17:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:01,745 INFO L93 Difference]: Finished difference Result 3822 states and 11523 transitions. [2018-12-03 17:17:01,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:17:01,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 17:17:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:01,753 INFO L225 Difference]: With dead ends: 3822 [2018-12-03 17:17:01,753 INFO L226 Difference]: Without dead ends: 3816 [2018-12-03 17:17:01,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:17:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2018-12-03 17:17:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2098. [2018-12-03 17:17:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-12-03 17:17:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 7405 transitions. [2018-12-03 17:17:03,864 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 7405 transitions. Word has length 9 [2018-12-03 17:17:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:03,864 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 7405 transitions. [2018-12-03 17:17:03,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:17:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 7405 transitions. [2018-12-03 17:17:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:17:03,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:03,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:03,867 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:03,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:03,867 INFO L82 PathProgramCache]: Analyzing trace with hash -204435682, now seen corresponding path program 1 times [2018-12-03 17:17:03,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:03,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:03,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:03,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:03,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:03,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:03,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:17:03,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:17:03,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:17:03,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:17:03,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:17:03,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:17:03,983 INFO L87 Difference]: Start difference. First operand 2098 states and 7405 transitions. Second operand 9 states. [2018-12-03 17:17:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:13,181 INFO L93 Difference]: Finished difference Result 4144 states and 12499 transitions. [2018-12-03 17:17:13,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:17:13,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 17:17:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:13,189 INFO L225 Difference]: With dead ends: 4144 [2018-12-03 17:17:13,189 INFO L226 Difference]: Without dead ends: 4138 [2018-12-03 17:17:13,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:17:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2018-12-03 17:17:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2260. [2018-12-03 17:17:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2018-12-03 17:17:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 7995 transitions. [2018-12-03 17:17:15,680 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 7995 transitions. Word has length 9 [2018-12-03 17:17:15,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:15,680 INFO L480 AbstractCegarLoop]: Abstraction has 2260 states and 7995 transitions. [2018-12-03 17:17:15,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:17:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 7995 transitions. [2018-12-03 17:17:15,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:17:15,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:15,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:15,682 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:15,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:15,682 INFO L82 PathProgramCache]: Analyzing trace with hash -204435307, now seen corresponding path program 1 times [2018-12-03 17:17:15,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:15,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:15,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:15,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:15,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:15,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:17:15,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:17:15,832 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:17:15,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:17:15,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:17:15,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:17:15,833 INFO L87 Difference]: Start difference. First operand 2260 states and 7995 transitions. Second operand 9 states. [2018-12-03 17:17:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:23,181 INFO L93 Difference]: Finished difference Result 3320 states and 10163 transitions. [2018-12-03 17:17:23,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:17:23,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 17:17:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:23,189 INFO L225 Difference]: With dead ends: 3320 [2018-12-03 17:17:23,189 INFO L226 Difference]: Without dead ends: 3314 [2018-12-03 17:17:23,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:17:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2018-12-03 17:17:25,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2191. [2018-12-03 17:17:25,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2018-12-03 17:17:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 7721 transitions. [2018-12-03 17:17:25,593 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 7721 transitions. Word has length 9 [2018-12-03 17:17:25,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:25,593 INFO L480 AbstractCegarLoop]: Abstraction has 2191 states and 7721 transitions. [2018-12-03 17:17:25,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:17:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 7721 transitions. [2018-12-03 17:17:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:17:25,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:25,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:25,595 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:25,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash -966522519, now seen corresponding path program 1 times [2018-12-03 17:17:25,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:25,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:25,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:25,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:17:25,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:17:25,704 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:17:25,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:17:25,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:17:25,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:17:25,705 INFO L87 Difference]: Start difference. First operand 2191 states and 7721 transitions. Second operand 8 states. [2018-12-03 17:17:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:35,052 INFO L93 Difference]: Finished difference Result 4113 states and 13014 transitions. [2018-12-03 17:17:35,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:17:35,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:17:35,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:35,061 INFO L225 Difference]: With dead ends: 4113 [2018-12-03 17:17:35,062 INFO L226 Difference]: Without dead ends: 4107 [2018-12-03 17:17:35,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:17:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2018-12-03 17:17:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 2224. [2018-12-03 17:17:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-12-03 17:17:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 7857 transitions. [2018-12-03 17:17:37,599 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 7857 transitions. Word has length 9 [2018-12-03 17:17:37,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:37,600 INFO L480 AbstractCegarLoop]: Abstraction has 2224 states and 7857 transitions. [2018-12-03 17:17:37,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:17:37,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 7857 transitions. [2018-12-03 17:17:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:17:37,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:37,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:37,601 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:37,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:37,602 INFO L82 PathProgramCache]: Analyzing trace with hash -966522144, now seen corresponding path program 1 times [2018-12-03 17:17:37,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:37,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:37,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:37,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:37,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:38,143 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 8 [2018-12-03 17:17:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:38,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:17:38,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:17:38,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:17:38,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:17:38,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:17:38,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:17:38,166 INFO L87 Difference]: Start difference. First operand 2224 states and 7857 transitions. Second operand 8 states. [2018-12-03 17:17:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:48,047 INFO L93 Difference]: Finished difference Result 4521 states and 14364 transitions. [2018-12-03 17:17:48,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:17:48,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:17:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:48,057 INFO L225 Difference]: With dead ends: 4521 [2018-12-03 17:17:48,057 INFO L226 Difference]: Without dead ends: 4515 [2018-12-03 17:17:48,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:17:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2018-12-03 17:17:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 2187. [2018-12-03 17:17:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2187 states. [2018-12-03 17:17:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 7764 transitions. [2018-12-03 17:17:50,657 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 7764 transitions. Word has length 9 [2018-12-03 17:17:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:50,657 INFO L480 AbstractCegarLoop]: Abstraction has 2187 states and 7764 transitions. [2018-12-03 17:17:50,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:17:50,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 7764 transitions. [2018-12-03 17:17:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:17:50,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:50,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:50,659 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:50,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:50,659 INFO L82 PathProgramCache]: Analyzing trace with hash -703458751, now seen corresponding path program 1 times [2018-12-03 17:17:50,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:50,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:50,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:50,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:50,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:50,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:17:50,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:17:50,779 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:17:50,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:17:50,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:17:50,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:17:50,780 INFO L87 Difference]: Start difference. First operand 2187 states and 7764 transitions. Second operand 8 states. [2018-12-03 17:18:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:00,363 INFO L93 Difference]: Finished difference Result 3855 states and 12150 transitions. [2018-12-03 17:18:00,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:18:00,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:18:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:00,371 INFO L225 Difference]: With dead ends: 3855 [2018-12-03 17:18:00,371 INFO L226 Difference]: Without dead ends: 3849 [2018-12-03 17:18:00,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:18:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2018-12-03 17:18:02,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 2143. [2018-12-03 17:18:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2143 states. [2018-12-03 17:18:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 7583 transitions. [2018-12-03 17:18:02,866 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 7583 transitions. Word has length 9 [2018-12-03 17:18:02,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:02,866 INFO L480 AbstractCegarLoop]: Abstraction has 2143 states and 7583 transitions. [2018-12-03 17:18:02,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:18:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 7583 transitions. [2018-12-03 17:18:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:18:02,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:02,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:02,868 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:02,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:02,868 INFO L82 PathProgramCache]: Analyzing trace with hash -703458376, now seen corresponding path program 1 times [2018-12-03 17:18:02,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:02,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:02,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:02,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:02,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:03,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:18:03,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:18:03,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:18:03,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:18:03,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:18:03,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:18:03,017 INFO L87 Difference]: Start difference. First operand 2143 states and 7583 transitions. Second operand 8 states. [2018-12-03 17:18:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:13,094 INFO L93 Difference]: Finished difference Result 4238 states and 13299 transitions. [2018-12-03 17:18:13,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:18:13,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:18:13,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:13,104 INFO L225 Difference]: With dead ends: 4238 [2018-12-03 17:18:13,104 INFO L226 Difference]: Without dead ends: 4236 [2018-12-03 17:18:13,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:18:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4236 states. [2018-12-03 17:18:15,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4236 to 2077. [2018-12-03 17:18:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2077 states. [2018-12-03 17:18:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 7307 transitions. [2018-12-03 17:18:15,727 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 7307 transitions. Word has length 9 [2018-12-03 17:18:15,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:15,727 INFO L480 AbstractCegarLoop]: Abstraction has 2077 states and 7307 transitions. [2018-12-03 17:18:15,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:18:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 7307 transitions. [2018-12-03 17:18:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:18:15,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:15,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:15,729 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:15,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:15,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2069416361, now seen corresponding path program 1 times [2018-12-03 17:18:15,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:15,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:15,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:15,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:15,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:15,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:18:15,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:18:15,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:18:15,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:18:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:18:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:18:15,835 INFO L87 Difference]: Start difference. First operand 2077 states and 7307 transitions. Second operand 8 states. [2018-12-03 17:18:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:27,257 INFO L93 Difference]: Finished difference Result 4709 states and 14887 transitions. [2018-12-03 17:18:27,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:18:27,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:18:27,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:27,267 INFO L225 Difference]: With dead ends: 4709 [2018-12-03 17:18:27,267 INFO L226 Difference]: Without dead ends: 4703 [2018-12-03 17:18:27,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=346, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:18:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4703 states. [2018-12-03 17:18:29,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4703 to 2205. [2018-12-03 17:18:29,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2018-12-03 17:18:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 7795 transitions. [2018-12-03 17:18:29,964 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 7795 transitions. Word has length 9 [2018-12-03 17:18:29,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:29,964 INFO L480 AbstractCegarLoop]: Abstraction has 2205 states and 7795 transitions. [2018-12-03 17:18:29,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:18:29,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 7795 transitions. [2018-12-03 17:18:29,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:18:29,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:29,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:29,966 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:29,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:29,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2069416736, now seen corresponding path program 1 times [2018-12-03 17:18:29,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:29,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:29,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:29,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:29,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:30,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:18:30,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:18:30,253 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:18:30,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:18:30,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:18:30,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:18:30,253 INFO L87 Difference]: Start difference. First operand 2205 states and 7795 transitions. Second operand 8 states. [2018-12-03 17:18:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:39,634 INFO L93 Difference]: Finished difference Result 4247 states and 13579 transitions. [2018-12-03 17:18:39,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:18:39,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:18:39,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:39,642 INFO L225 Difference]: With dead ends: 4247 [2018-12-03 17:18:39,642 INFO L226 Difference]: Without dead ends: 4241 [2018-12-03 17:18:39,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:18:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4241 states. [2018-12-03 17:18:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4241 to 2723. [2018-12-03 17:18:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2018-12-03 17:18:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 9843 transitions. [2018-12-03 17:18:43,153 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 9843 transitions. Word has length 9 [2018-12-03 17:18:43,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:43,153 INFO L480 AbstractCegarLoop]: Abstraction has 2723 states and 9843 transitions. [2018-12-03 17:18:43,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:18:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 9843 transitions. [2018-12-03 17:18:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:18:43,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:43,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:43,155 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:43,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:43,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2017829461, now seen corresponding path program 1 times [2018-12-03 17:18:43,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:43,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:43,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:43,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:43,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:43,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:18:43,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:18:43,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:18:43,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:18:43,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:18:43,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:18:43,363 INFO L87 Difference]: Start difference. First operand 2723 states and 9843 transitions. Second operand 9 states. [2018-12-03 17:18:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:52,067 INFO L93 Difference]: Finished difference Result 6774 states and 23375 transitions. [2018-12-03 17:18:52,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:18:52,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 17:18:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:52,077 INFO L225 Difference]: With dead ends: 6774 [2018-12-03 17:18:52,077 INFO L226 Difference]: Without dead ends: 4052 [2018-12-03 17:18:52,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:18:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2018-12-03 17:18:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 2719. [2018-12-03 17:18:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2719 states. [2018-12-03 17:18:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 9745 transitions. [2018-12-03 17:18:55,603 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 9745 transitions. Word has length 9 [2018-12-03 17:18:55,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:55,603 INFO L480 AbstractCegarLoop]: Abstraction has 2719 states and 9745 transitions. [2018-12-03 17:18:55,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:18:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 9745 transitions. [2018-12-03 17:18:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:18:55,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:55,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:55,605 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:55,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:55,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2017829350, now seen corresponding path program 1 times [2018-12-03 17:18:55,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:55,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:55,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:55,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:55,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:55,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:18:55,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:18:55,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:18:55,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:18:55,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:18:55,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:18:55,693 INFO L87 Difference]: Start difference. First operand 2719 states and 9745 transitions. Second operand 9 states. [2018-12-03 17:19:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:04,999 INFO L93 Difference]: Finished difference Result 3818 states and 12356 transitions. [2018-12-03 17:19:04,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:19:04,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 17:19:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:05,006 INFO L225 Difference]: With dead ends: 3818 [2018-12-03 17:19:05,006 INFO L226 Difference]: Without dead ends: 3812 [2018-12-03 17:19:05,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=625, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:19:05,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2018-12-03 17:19:08,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 2654. [2018-12-03 17:19:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2018-12-03 17:19:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 9529 transitions. [2018-12-03 17:19:08,633 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 9529 transitions. Word has length 9 [2018-12-03 17:19:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:08,634 INFO L480 AbstractCegarLoop]: Abstraction has 2654 states and 9529 transitions. [2018-12-03 17:19:08,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:19:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 9529 transitions. [2018-12-03 17:19:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:19:08,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:08,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:19:08,635 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:08,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:08,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1544214472, now seen corresponding path program 1 times [2018-12-03 17:19:08,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:08,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:08,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:08,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:08,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:08,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:19:08,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:19:08,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:19:08,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:19:08,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:19:08,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:19:08,771 INFO L87 Difference]: Start difference. First operand 2654 states and 9529 transitions. Second operand 9 states. [2018-12-03 17:19:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:18,203 INFO L93 Difference]: Finished difference Result 6017 states and 20262 transitions. [2018-12-03 17:19:18,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:19:18,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 17:19:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:18,212 INFO L225 Difference]: With dead ends: 6017 [2018-12-03 17:19:18,212 INFO L226 Difference]: Without dead ends: 3832 [2018-12-03 17:19:18,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:19:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3832 states. [2018-12-03 17:19:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3832 to 2609. [2018-12-03 17:19:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2609 states. [2018-12-03 17:19:21,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 9097 transitions. [2018-12-03 17:19:21,778 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 9097 transitions. Word has length 9 [2018-12-03 17:19:21,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:21,779 INFO L480 AbstractCegarLoop]: Abstraction has 2609 states and 9097 transitions. [2018-12-03 17:19:21,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:19:21,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 9097 transitions. [2018-12-03 17:19:21,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:19:21,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:21,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:19:21,780 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:21,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:21,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1544214097, now seen corresponding path program 1 times [2018-12-03 17:19:21,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:21,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:21,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:21,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:19:21,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:19:21,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:19:21,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:19:21,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:19:21,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:19:21,889 INFO L87 Difference]: Start difference. First operand 2609 states and 9097 transitions. Second operand 9 states. [2018-12-03 17:19:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:33,836 INFO L93 Difference]: Finished difference Result 4453 states and 13944 transitions. [2018-12-03 17:19:33,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:19:33,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 17:19:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:33,845 INFO L225 Difference]: With dead ends: 4453 [2018-12-03 17:19:33,845 INFO L226 Difference]: Without dead ends: 4447 [2018-12-03 17:19:33,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=625, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:19:33,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2018-12-03 17:19:37,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 2339. [2018-12-03 17:19:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2339 states. [2018-12-03 17:19:37,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 8091 transitions. [2018-12-03 17:19:37,137 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 8091 transitions. Word has length 9 [2018-12-03 17:19:37,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:37,137 INFO L480 AbstractCegarLoop]: Abstraction has 2339 states and 8091 transitions. [2018-12-03 17:19:37,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:19:37,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 8091 transitions. [2018-12-03 17:19:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:19:37,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:37,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:19:37,139 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:37,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:37,140 INFO L82 PathProgramCache]: Analyzing trace with hash -164665634, now seen corresponding path program 1 times [2018-12-03 17:19:37,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:37,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:37,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:37,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:37,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:37,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:19:37,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:19:37,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:19:37,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:19:37,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:19:37,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:19:37,377 INFO L87 Difference]: Start difference. First operand 2339 states and 8091 transitions. Second operand 8 states. [2018-12-03 17:19:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:47,083 INFO L93 Difference]: Finished difference Result 3691 states and 11650 transitions. [2018-12-03 17:19:47,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:19:47,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:19:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:47,091 INFO L225 Difference]: With dead ends: 3691 [2018-12-03 17:19:47,091 INFO L226 Difference]: Without dead ends: 3689 [2018-12-03 17:19:47,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:19:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2018-12-03 17:19:50,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 2341. [2018-12-03 17:19:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2341 states. [2018-12-03 17:19:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 8100 transitions. [2018-12-03 17:19:50,537 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 8100 transitions. Word has length 9 [2018-12-03 17:19:50,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:50,538 INFO L480 AbstractCegarLoop]: Abstraction has 2341 states and 8100 transitions. [2018-12-03 17:19:50,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:19:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 8100 transitions. [2018-12-03 17:19:50,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:19:50,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:50,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:19:50,539 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:50,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:50,539 INFO L82 PathProgramCache]: Analyzing trace with hash -164665523, now seen corresponding path program 1 times [2018-12-03 17:19:50,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:50,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:50,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:50,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:50,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:51,217 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 8 [2018-12-03 17:19:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:51,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:19:51,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:19:51,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:19:51,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:19:51,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:19:51,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:19:51,241 INFO L87 Difference]: Start difference. First operand 2341 states and 8100 transitions. Second operand 8 states. [2018-12-03 17:20:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:00,615 INFO L93 Difference]: Finished difference Result 3575 states and 11166 transitions. [2018-12-03 17:20:00,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:20:00,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:20:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:00,622 INFO L225 Difference]: With dead ends: 3575 [2018-12-03 17:20:00,623 INFO L226 Difference]: Without dead ends: 3569 [2018-12-03 17:20:00,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:20:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2018-12-03 17:20:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 2282. [2018-12-03 17:20:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2018-12-03 17:20:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 7890 transitions. [2018-12-03 17:20:04,121 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 7890 transitions. Word has length 9 [2018-12-03 17:20:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:04,121 INFO L480 AbstractCegarLoop]: Abstraction has 2282 states and 7890 transitions. [2018-12-03 17:20:04,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:20:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 7890 transitions. [2018-12-03 17:20:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:20:04,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:04,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:20:04,122 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:04,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:04,122 INFO L82 PathProgramCache]: Analyzing trace with hash 105933428, now seen corresponding path program 1 times [2018-12-03 17:20:04,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:04,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:04,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:04,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:04,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:04,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:20:04,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:20:04,230 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:20:04,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:20:04,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:20:04,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:20:04,231 INFO L87 Difference]: Start difference. First operand 2282 states and 7890 transitions. Second operand 8 states. [2018-12-03 17:20:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:13,479 INFO L93 Difference]: Finished difference Result 3555 states and 11315 transitions. [2018-12-03 17:20:13,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:20:13,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:20:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:13,485 INFO L225 Difference]: With dead ends: 3555 [2018-12-03 17:20:13,485 INFO L226 Difference]: Without dead ends: 3549 [2018-12-03 17:20:13,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:20:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2018-12-03 17:20:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 2245. [2018-12-03 17:20:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2018-12-03 17:20:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 7736 transitions. [2018-12-03 17:20:16,788 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 7736 transitions. Word has length 9 [2018-12-03 17:20:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:16,789 INFO L480 AbstractCegarLoop]: Abstraction has 2245 states and 7736 transitions. [2018-12-03 17:20:16,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:20:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 7736 transitions. [2018-12-03 17:20:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:20:16,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:16,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:20:16,791 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:16,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:16,791 INFO L82 PathProgramCache]: Analyzing trace with hash 105933539, now seen corresponding path program 1 times [2018-12-03 17:20:16,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:16,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:16,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:16,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:16,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:17,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:20:17,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:20:17,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:20:17,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:20:17,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:20:17,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:20:17,083 INFO L87 Difference]: Start difference. First operand 2245 states and 7736 transitions. Second operand 8 states. [2018-12-03 17:20:19,281 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 17:20:26,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:26,261 INFO L93 Difference]: Finished difference Result 3393 states and 10634 transitions. [2018-12-03 17:20:26,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:20:26,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 17:20:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:26,268 INFO L225 Difference]: With dead ends: 3393 [2018-12-03 17:20:26,268 INFO L226 Difference]: Without dead ends: 3391 [2018-12-03 17:20:26,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:20:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2018-12-03 17:20:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 2207. [2018-12-03 17:20:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2018-12-03 17:20:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 7572 transitions. [2018-12-03 17:20:29,715 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 7572 transitions. Word has length 9 [2018-12-03 17:20:29,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:29,716 INFO L480 AbstractCegarLoop]: Abstraction has 2207 states and 7572 transitions. [2018-12-03 17:20:29,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:20:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 7572 transitions. [2018-12-03 17:20:29,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:20:29,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:29,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:20:29,717 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:29,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:29,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1791280574, now seen corresponding path program 1 times [2018-12-03 17:20:29,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:29,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:29,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:29,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:29,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:29,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:20:29,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:20:29,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:20:29,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:20:29,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:20:29,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:20:29,742 INFO L87 Difference]: Start difference. First operand 2207 states and 7572 transitions. Second operand 4 states. [2018-12-03 17:20:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:32,095 INFO L93 Difference]: Finished difference Result 3105 states and 10535 transitions. [2018-12-03 17:20:32,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:20:32,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-03 17:20:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:32,098 INFO L225 Difference]: With dead ends: 3105 [2018-12-03 17:20:32,098 INFO L226 Difference]: Without dead ends: 1193 [2018-12-03 17:20:32,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:20:32,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2018-12-03 17:20:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 543. [2018-12-03 17:20:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-12-03 17:20:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1674 transitions. [2018-12-03 17:20:33,351 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1674 transitions. Word has length 11 [2018-12-03 17:20:33,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:33,351 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 1674 transitions. [2018-12-03 17:20:33,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:20:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1674 transitions. [2018-12-03 17:20:33,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:20:33,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:33,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:20:33,352 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:33,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:33,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1790113719, now seen corresponding path program 1 times [2018-12-03 17:20:33,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:33,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:33,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:33,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:33,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:33,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:20:33,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:20:33,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:20:33,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:20:33,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:20:33,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:20:33,482 INFO L87 Difference]: Start difference. First operand 543 states and 1674 transitions. Second operand 10 states. [2018-12-03 17:20:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:49,696 INFO L93 Difference]: Finished difference Result 3379 states and 8888 transitions. [2018-12-03 17:20:49,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:20:49,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:20:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:49,702 INFO L225 Difference]: With dead ends: 3379 [2018-12-03 17:20:49,702 INFO L226 Difference]: Without dead ends: 3182 [2018-12-03 17:20:49,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=527, Invalid=1729, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:20:49,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2018-12-03 17:20:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 987. [2018-12-03 17:20:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2018-12-03 17:20:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 3210 transitions. [2018-12-03 17:20:51,948 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 3210 transitions. Word has length 11 [2018-12-03 17:20:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:51,948 INFO L480 AbstractCegarLoop]: Abstraction has 987 states and 3210 transitions. [2018-12-03 17:20:51,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:20:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 3210 transitions. [2018-12-03 17:20:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:20:51,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:51,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:20:51,949 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:51,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:51,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1790113722, now seen corresponding path program 1 times [2018-12-03 17:20:51,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:51,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:51,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:51,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:51,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:52,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:20:52,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:20:52,110 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:20:52,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:20:52,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:20:52,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:20:52,110 INFO L87 Difference]: Start difference. First operand 987 states and 3210 transitions. Second operand 10 states. [2018-12-03 17:21:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:05,248 INFO L93 Difference]: Finished difference Result 3217 states and 8817 transitions. [2018-12-03 17:21:05,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:21:05,249 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:21:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:05,254 INFO L225 Difference]: With dead ends: 3217 [2018-12-03 17:21:05,254 INFO L226 Difference]: Without dead ends: 2555 [2018-12-03 17:21:05,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:21:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2018-12-03 17:21:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 1088. [2018-12-03 17:21:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2018-12-03 17:21:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 3479 transitions. [2018-12-03 17:21:07,753 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 3479 transitions. Word has length 11 [2018-12-03 17:21:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:07,754 INFO L480 AbstractCegarLoop]: Abstraction has 1088 states and 3479 transitions. [2018-12-03 17:21:07,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:21:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 3479 transitions. [2018-12-03 17:21:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:21:07,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:07,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:21:07,755 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:07,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:07,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1790113725, now seen corresponding path program 1 times [2018-12-03 17:21:07,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:07,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:07,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:07,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:07,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:07,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:21:07,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:21:07,861 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:21:07,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:21:07,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:21:07,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:21:07,862 INFO L87 Difference]: Start difference. First operand 1088 states and 3479 transitions. Second operand 10 states. [2018-12-03 17:21:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:21,374 INFO L93 Difference]: Finished difference Result 2969 states and 8028 transitions. [2018-12-03 17:21:21,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:21:21,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:21:21,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:21,380 INFO L225 Difference]: With dead ends: 2969 [2018-12-03 17:21:21,381 INFO L226 Difference]: Without dead ends: 2960 [2018-12-03 17:21:21,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=341, Invalid=1381, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:21:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2018-12-03 17:21:23,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1191. [2018-12-03 17:21:23,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-12-03 17:21:23,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 3784 transitions. [2018-12-03 17:21:23,983 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 3784 transitions. Word has length 11 [2018-12-03 17:21:23,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:23,983 INFO L480 AbstractCegarLoop]: Abstraction has 1191 states and 3784 transitions. [2018-12-03 17:21:23,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:21:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 3784 transitions. [2018-12-03 17:21:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:21:23,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:23,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:21:23,985 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:23,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:23,985 INFO L82 PathProgramCache]: Analyzing trace with hash 888605920, now seen corresponding path program 1 times [2018-12-03 17:21:23,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:23,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:23,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:23,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:23,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:24,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:21:24,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:21:24,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:21:24,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:21:24,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:21:24,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:21:24,124 INFO L87 Difference]: Start difference. First operand 1191 states and 3784 transitions. Second operand 10 states. [2018-12-03 17:21:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:45,665 INFO L93 Difference]: Finished difference Result 4135 states and 11122 transitions. [2018-12-03 17:21:45,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 17:21:45,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:21:45,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:45,672 INFO L225 Difference]: With dead ends: 4135 [2018-12-03 17:21:45,673 INFO L226 Difference]: Without dead ends: 4126 [2018-12-03 17:21:45,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1912 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=888, Invalid=4812, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:21:45,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4126 states. [2018-12-03 17:21:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4126 to 1244. [2018-12-03 17:21:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2018-12-03 17:21:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 3975 transitions. [2018-12-03 17:21:48,573 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 3975 transitions. Word has length 11 [2018-12-03 17:21:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:48,573 INFO L480 AbstractCegarLoop]: Abstraction has 1244 states and 3975 transitions. [2018-12-03 17:21:48,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:21:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 3975 transitions. [2018-12-03 17:21:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:21:48,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:48,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:21:48,575 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:48,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:48,575 INFO L82 PathProgramCache]: Analyzing trace with hash 888605923, now seen corresponding path program 1 times [2018-12-03 17:21:48,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:48,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:48,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:48,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:48,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:48,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:21:48,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:21:48,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:21:48,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:21:48,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:21:48,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:21:48,726 INFO L87 Difference]: Start difference. First operand 1244 states and 3975 transitions. Second operand 10 states. [2018-12-03 17:22:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:04,460 INFO L93 Difference]: Finished difference Result 3332 states and 9049 transitions. [2018-12-03 17:22:04,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:22:04,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:22:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:04,466 INFO L225 Difference]: With dead ends: 3332 [2018-12-03 17:22:04,466 INFO L226 Difference]: Without dead ends: 3323 [2018-12-03 17:22:04,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=317, Invalid=1405, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:22:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2018-12-03 17:22:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 1265. [2018-12-03 17:22:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2018-12-03 17:22:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 4049 transitions. [2018-12-03 17:22:07,448 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 4049 transitions. Word has length 11 [2018-12-03 17:22:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:07,448 INFO L480 AbstractCegarLoop]: Abstraction has 1265 states and 4049 transitions. [2018-12-03 17:22:07,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:22:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 4049 transitions. [2018-12-03 17:22:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:22:07,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:07,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:22:07,449 INFO L423 AbstractCegarLoop]: === Iteration 72 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:07,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:07,449 INFO L82 PathProgramCache]: Analyzing trace with hash 888605926, now seen corresponding path program 1 times [2018-12-03 17:22:07,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:07,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:07,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:07,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:07,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:07,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:22:07,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:22:07,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:22:07,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:22:07,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:22:07,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:22:07,553 INFO L87 Difference]: Start difference. First operand 1265 states and 4049 transitions. Second operand 10 states. [2018-12-03 17:22:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:22,190 INFO L93 Difference]: Finished difference Result 3029 states and 8339 transitions. [2018-12-03 17:22:22,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:22:22,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:22:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:22,196 INFO L225 Difference]: With dead ends: 3029 [2018-12-03 17:22:22,196 INFO L226 Difference]: Without dead ends: 3026 [2018-12-03 17:22:22,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=293, Invalid=1189, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:22:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2018-12-03 17:22:25,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 1249. [2018-12-03 17:22:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1249 states. [2018-12-03 17:22:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 3989 transitions. [2018-12-03 17:22:25,245 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 3989 transitions. Word has length 11 [2018-12-03 17:22:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:25,245 INFO L480 AbstractCegarLoop]: Abstraction has 1249 states and 3989 transitions. [2018-12-03 17:22:25,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:22:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 3989 transitions. [2018-12-03 17:22:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:22:25,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:25,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:22:25,246 INFO L423 AbstractCegarLoop]: === Iteration 73 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:25,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:25,247 INFO L82 PathProgramCache]: Analyzing trace with hash 558747878, now seen corresponding path program 1 times [2018-12-03 17:22:25,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:25,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:25,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:25,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:25,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:25,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:22:25,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:22:25,386 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:22:25,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:22:25,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:22:25,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:22:25,387 INFO L87 Difference]: Start difference. First operand 1249 states and 3989 transitions. Second operand 10 states. [2018-12-03 17:22:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:48,439 INFO L93 Difference]: Finished difference Result 4529 states and 12161 transitions. [2018-12-03 17:22:48,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:22:48,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:22:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:48,448 INFO L225 Difference]: With dead ends: 4529 [2018-12-03 17:22:48,448 INFO L226 Difference]: Without dead ends: 4520 [2018-12-03 17:22:48,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=808, Invalid=3884, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 17:22:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2018-12-03 17:22:51,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 1267. [2018-12-03 17:22:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1267 states. [2018-12-03 17:22:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 4032 transitions. [2018-12-03 17:22:51,643 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 4032 transitions. Word has length 11 [2018-12-03 17:22:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:51,644 INFO L480 AbstractCegarLoop]: Abstraction has 1267 states and 4032 transitions. [2018-12-03 17:22:51,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:22:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 4032 transitions. [2018-12-03 17:22:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:22:51,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:51,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:22:51,645 INFO L423 AbstractCegarLoop]: === Iteration 74 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:51,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:51,645 INFO L82 PathProgramCache]: Analyzing trace with hash 558747881, now seen corresponding path program 1 times [2018-12-03 17:22:51,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:51,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:51,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:51,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:51,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:51,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:22:51,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:22:51,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:22:51,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:22:51,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:22:51,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:22:51,805 INFO L87 Difference]: Start difference. First operand 1267 states and 4032 transitions. Second operand 10 states. [2018-12-03 17:23:06,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:06,960 INFO L93 Difference]: Finished difference Result 3085 states and 8513 transitions. [2018-12-03 17:23:06,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:23:06,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:23:06,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:06,966 INFO L225 Difference]: With dead ends: 3085 [2018-12-03 17:23:06,966 INFO L226 Difference]: Without dead ends: 3076 [2018-12-03 17:23:06,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=984, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:23:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2018-12-03 17:23:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 1305. [2018-12-03 17:23:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2018-12-03 17:23:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 4165 transitions. [2018-12-03 17:23:10,094 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 4165 transitions. Word has length 11 [2018-12-03 17:23:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:10,094 INFO L480 AbstractCegarLoop]: Abstraction has 1305 states and 4165 transitions. [2018-12-03 17:23:10,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:23:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 4165 transitions. [2018-12-03 17:23:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:23:10,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:10,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:23:10,095 INFO L423 AbstractCegarLoop]: === Iteration 75 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:10,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:10,096 INFO L82 PathProgramCache]: Analyzing trace with hash 558747884, now seen corresponding path program 1 times [2018-12-03 17:23:10,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:10,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:10,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:10,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:10,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:10,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:23:10,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:23:10,227 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:23:10,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:23:10,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:23:10,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:23:10,227 INFO L87 Difference]: Start difference. First operand 1305 states and 4165 transitions. Second operand 10 states. [2018-12-03 17:23:25,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:25,993 INFO L93 Difference]: Finished difference Result 3119 states and 8661 transitions. [2018-12-03 17:23:25,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:23:25,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:23:25,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:25,998 INFO L225 Difference]: With dead ends: 3119 [2018-12-03 17:23:25,998 INFO L226 Difference]: Without dead ends: 3110 [2018-12-03 17:23:25,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=334, Invalid=1226, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:23:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2018-12-03 17:23:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 1341. [2018-12-03 17:23:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-12-03 17:23:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4276 transitions. [2018-12-03 17:23:29,418 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4276 transitions. Word has length 11 [2018-12-03 17:23:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:29,419 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4276 transitions. [2018-12-03 17:23:29,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:23:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4276 transitions. [2018-12-03 17:23:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:23:29,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:29,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:23:29,420 INFO L423 AbstractCegarLoop]: === Iteration 76 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:29,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:29,420 INFO L82 PathProgramCache]: Analyzing trace with hash 910106073, now seen corresponding path program 1 times [2018-12-03 17:23:29,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:29,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:29,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:29,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:23:29,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:23:29,594 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:23:29,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:23:29,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:23:29,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:23:29,594 INFO L87 Difference]: Start difference. First operand 1341 states and 4276 transitions. Second operand 10 states. [2018-12-03 17:23:31,410 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-12-03 17:23:43,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:43,578 INFO L93 Difference]: Finished difference Result 2739 states and 7735 transitions. [2018-12-03 17:23:43,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:23:43,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:23:43,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:43,583 INFO L225 Difference]: With dead ends: 2739 [2018-12-03 17:23:43,584 INFO L226 Difference]: Without dead ends: 2730 [2018-12-03 17:23:43,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:23:43,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2018-12-03 17:23:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 1376. [2018-12-03 17:23:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1376 states. [2018-12-03 17:23:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 4395 transitions. [2018-12-03 17:23:47,037 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 4395 transitions. Word has length 11 [2018-12-03 17:23:47,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:47,037 INFO L480 AbstractCegarLoop]: Abstraction has 1376 states and 4395 transitions. [2018-12-03 17:23:47,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:23:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 4395 transitions. [2018-12-03 17:23:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:23:47,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:47,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:23:47,039 INFO L423 AbstractCegarLoop]: === Iteration 77 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:47,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:47,039 INFO L82 PathProgramCache]: Analyzing trace with hash 910106076, now seen corresponding path program 1 times [2018-12-03 17:23:47,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:47,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:47,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:47,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:47,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:47,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:23:47,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:23:47,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:23:47,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:23:47,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:23:47,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:23:47,551 INFO L87 Difference]: Start difference. First operand 1376 states and 4395 transitions. Second operand 10 states. [2018-12-03 17:23:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:59,792 INFO L93 Difference]: Finished difference Result 2512 states and 7157 transitions. [2018-12-03 17:23:59,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:23:59,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:23:59,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:59,797 INFO L225 Difference]: With dead ends: 2512 [2018-12-03 17:23:59,797 INFO L226 Difference]: Without dead ends: 2503 [2018-12-03 17:23:59,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:23:59,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2018-12-03 17:24:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1401. [2018-12-03 17:24:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2018-12-03 17:24:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 4478 transitions. [2018-12-03 17:24:03,311 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 4478 transitions. Word has length 11 [2018-12-03 17:24:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:24:03,311 INFO L480 AbstractCegarLoop]: Abstraction has 1401 states and 4478 transitions. [2018-12-03 17:24:03,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:24:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 4478 transitions. [2018-12-03 17:24:03,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:24:03,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:24:03,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:24:03,312 INFO L423 AbstractCegarLoop]: === Iteration 78 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:24:03,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:03,312 INFO L82 PathProgramCache]: Analyzing trace with hash 910106079, now seen corresponding path program 1 times [2018-12-03 17:24:03,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:24:03,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:03,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:24:03,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:03,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:24:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:03,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:24:03,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:24:03,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:24:03,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:24:03,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:24:03,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:24:03,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:24:03,465 INFO L87 Difference]: Start difference. First operand 1401 states and 4478 transitions. Second operand 10 states. [2018-12-03 17:24:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:24:19,096 INFO L93 Difference]: Finished difference Result 3207 states and 9059 transitions. [2018-12-03 17:24:19,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:24:19,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:24:19,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:24:19,103 INFO L225 Difference]: With dead ends: 3207 [2018-12-03 17:24:19,103 INFO L226 Difference]: Without dead ends: 3198 [2018-12-03 17:24:19,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:24:19,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3198 states. [2018-12-03 17:24:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3198 to 1415. [2018-12-03 17:24:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2018-12-03 17:24:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 4523 transitions. [2018-12-03 17:24:22,829 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 4523 transitions. Word has length 11 [2018-12-03 17:24:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:24:22,829 INFO L480 AbstractCegarLoop]: Abstraction has 1415 states and 4523 transitions. [2018-12-03 17:24:22,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:24:22,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 4523 transitions. [2018-12-03 17:24:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:24:22,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:24:22,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:24:22,830 INFO L423 AbstractCegarLoop]: === Iteration 79 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:24:22,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:22,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1141109579, now seen corresponding path program 1 times [2018-12-03 17:24:22,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:24:22,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:22,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:24:22,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:22,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:24:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:24:23,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:24:23,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:24:23,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:24:23,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:24:23,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:24:23,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:24:23,015 INFO L87 Difference]: Start difference. First operand 1415 states and 4523 transitions. Second operand 10 states. [2018-12-03 17:24:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:24:34,660 INFO L93 Difference]: Finished difference Result 2338 states and 6757 transitions. [2018-12-03 17:24:34,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:24:34,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:24:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:24:34,664 INFO L225 Difference]: With dead ends: 2338 [2018-12-03 17:24:34,664 INFO L226 Difference]: Without dead ends: 2329 [2018-12-03 17:24:34,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:24:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2018-12-03 17:24:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1454. [2018-12-03 17:24:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-12-03 17:24:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 4664 transitions. [2018-12-03 17:24:38,396 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 4664 transitions. Word has length 11 [2018-12-03 17:24:38,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:24:38,396 INFO L480 AbstractCegarLoop]: Abstraction has 1454 states and 4664 transitions. [2018-12-03 17:24:38,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:24:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 4664 transitions. [2018-12-03 17:24:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:24:38,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:24:38,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:24:38,398 INFO L423 AbstractCegarLoop]: === Iteration 80 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:24:38,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:38,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1141109582, now seen corresponding path program 1 times [2018-12-03 17:24:38,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:24:38,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:38,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:24:38,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:38,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:24:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:24:38,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:24:38,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:24:38,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:24:38,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:24:38,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:24:38,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:24:38,530 INFO L87 Difference]: Start difference. First operand 1454 states and 4664 transitions. Second operand 10 states. [2018-12-03 17:24:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:24:49,685 INFO L93 Difference]: Finished difference Result 3078 states and 9084 transitions. [2018-12-03 17:24:49,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:24:49,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:24:49,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:24:49,689 INFO L225 Difference]: With dead ends: 3078 [2018-12-03 17:24:49,689 INFO L226 Difference]: Without dead ends: 2252 [2018-12-03 17:24:49,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:24:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2018-12-03 17:24:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 1520. [2018-12-03 17:24:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2018-12-03 17:24:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 4843 transitions. [2018-12-03 17:24:53,649 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 4843 transitions. Word has length 11 [2018-12-03 17:24:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:24:53,649 INFO L480 AbstractCegarLoop]: Abstraction has 1520 states and 4843 transitions. [2018-12-03 17:24:53,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:24:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 4843 transitions. [2018-12-03 17:24:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:24:53,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:24:53,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:24:53,650 INFO L423 AbstractCegarLoop]: === Iteration 81 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:24:53,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:53,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1141109585, now seen corresponding path program 1 times [2018-12-03 17:24:53,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:24:53,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:53,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:24:53,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:53,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:24:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:24:53,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:24:53,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:24:53,887 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:24:53,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:24:53,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:24:53,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:24:53,888 INFO L87 Difference]: Start difference. First operand 1520 states and 4843 transitions. Second operand 10 states. [2018-12-03 17:25:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:25:07,453 INFO L93 Difference]: Finished difference Result 2757 states and 7897 transitions. [2018-12-03 17:25:07,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:25:07,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:25:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:25:07,458 INFO L225 Difference]: With dead ends: 2757 [2018-12-03 17:25:07,458 INFO L226 Difference]: Without dead ends: 2748 [2018-12-03 17:25:07,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:25:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2018-12-03 17:25:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 1677. [2018-12-03 17:25:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2018-12-03 17:25:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 5316 transitions. [2018-12-03 17:25:12,077 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 5316 transitions. Word has length 11 [2018-12-03 17:25:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:25:12,077 INFO L480 AbstractCegarLoop]: Abstraction has 1677 states and 5316 transitions. [2018-12-03 17:25:12,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:25:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 5316 transitions. [2018-12-03 17:25:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:25:12,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:25:12,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:25:12,078 INFO L423 AbstractCegarLoop]: === Iteration 82 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:25:12,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:12,079 INFO L82 PathProgramCache]: Analyzing trace with hash 641174699, now seen corresponding path program 1 times [2018-12-03 17:25:12,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:25:12,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:12,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:25:12,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:12,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:25:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:25:12,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:25:12,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:25:12,194 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:25:12,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:25:12,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:25:12,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:25:12,195 INFO L87 Difference]: Start difference. First operand 1677 states and 5316 transitions. Second operand 10 states. [2018-12-03 17:25:28,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:25:28,182 INFO L93 Difference]: Finished difference Result 3023 states and 8545 transitions. [2018-12-03 17:25:28,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:25:28,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:25:28,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:25:28,188 INFO L225 Difference]: With dead ends: 3023 [2018-12-03 17:25:28,188 INFO L226 Difference]: Without dead ends: 3014 [2018-12-03 17:25:28,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=258, Invalid=1148, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:25:28,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2018-12-03 17:25:32,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 1721. [2018-12-03 17:25:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1721 states. [2018-12-03 17:25:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 5467 transitions. [2018-12-03 17:25:32,922 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 5467 transitions. Word has length 11 [2018-12-03 17:25:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:25:32,923 INFO L480 AbstractCegarLoop]: Abstraction has 1721 states and 5467 transitions. [2018-12-03 17:25:32,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:25:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 5467 transitions. [2018-12-03 17:25:32,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:25:32,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:25:32,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:25:32,925 INFO L423 AbstractCegarLoop]: === Iteration 83 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:25:32,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:32,925 INFO L82 PathProgramCache]: Analyzing trace with hash 641174702, now seen corresponding path program 1 times [2018-12-03 17:25:32,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:25:32,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:32,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:25:32,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:32,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:25:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:25:33,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:25:33,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:25:33,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:25:33,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:25:33,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:25:33,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:25:33,589 INFO L87 Difference]: Start difference. First operand 1721 states and 5467 transitions. Second operand 10 states. [2018-12-03 17:25:49,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:25:49,313 INFO L93 Difference]: Finished difference Result 2959 states and 8425 transitions. [2018-12-03 17:25:49,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:25:49,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:25:49,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:25:49,319 INFO L225 Difference]: With dead ends: 2959 [2018-12-03 17:25:49,319 INFO L226 Difference]: Without dead ends: 2950 [2018-12-03 17:25:49,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:25:49,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2018-12-03 17:25:54,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1706. [2018-12-03 17:25:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2018-12-03 17:25:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 5408 transitions. [2018-12-03 17:25:54,130 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 5408 transitions. Word has length 11 [2018-12-03 17:25:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:25:54,130 INFO L480 AbstractCegarLoop]: Abstraction has 1706 states and 5408 transitions. [2018-12-03 17:25:54,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:25:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 5408 transitions. [2018-12-03 17:25:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:25:54,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:25:54,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:25:54,132 INFO L423 AbstractCegarLoop]: === Iteration 84 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:25:54,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:54,132 INFO L82 PathProgramCache]: Analyzing trace with hash 641174705, now seen corresponding path program 1 times [2018-12-03 17:25:54,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:25:54,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:54,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:25:54,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:54,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:25:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:25:54,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:25:54,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:25:54,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:25:54,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:25:54,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:25:54,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:25:54,330 INFO L87 Difference]: Start difference. First operand 1706 states and 5408 transitions. Second operand 10 states. [2018-12-03 17:26:12,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:13,000 INFO L93 Difference]: Finished difference Result 3515 states and 10000 transitions. [2018-12-03 17:26:13,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:26:13,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:26:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:13,006 INFO L225 Difference]: With dead ends: 3515 [2018-12-03 17:26:13,007 INFO L226 Difference]: Without dead ends: 3512 [2018-12-03 17:26:13,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=906, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:26:13,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2018-12-03 17:26:17,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 1674. [2018-12-03 17:26:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2018-12-03 17:26:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 5323 transitions. [2018-12-03 17:26:17,744 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 5323 transitions. Word has length 11 [2018-12-03 17:26:17,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:17,744 INFO L480 AbstractCegarLoop]: Abstraction has 1674 states and 5323 transitions. [2018-12-03 17:26:17,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:26:17,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 5323 transitions. [2018-12-03 17:26:17,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:26:17,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:17,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:26:17,746 INFO L423 AbstractCegarLoop]: === Iteration 85 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:17,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash 311316657, now seen corresponding path program 1 times [2018-12-03 17:26:17,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:17,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:17,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:17,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:17,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:17,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:26:17,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:26:17,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:26:17,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:26:17,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:26:17,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:26:17,933 INFO L87 Difference]: Start difference. First operand 1674 states and 5323 transitions. Second operand 10 states. [2018-12-03 17:26:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:37,406 INFO L93 Difference]: Finished difference Result 3480 states and 9801 transitions. [2018-12-03 17:26:37,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:26:37,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:26:37,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:37,414 INFO L225 Difference]: With dead ends: 3480 [2018-12-03 17:26:37,414 INFO L226 Difference]: Without dead ends: 3471 [2018-12-03 17:26:37,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=400, Invalid=1952, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:26:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3471 states. [2018-12-03 17:26:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3471 to 1683. [2018-12-03 17:26:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2018-12-03 17:26:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 5340 transitions. [2018-12-03 17:26:42,426 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 5340 transitions. Word has length 11 [2018-12-03 17:26:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:42,427 INFO L480 AbstractCegarLoop]: Abstraction has 1683 states and 5340 transitions. [2018-12-03 17:26:42,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:26:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 5340 transitions. [2018-12-03 17:26:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:26:42,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:42,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:26:42,429 INFO L423 AbstractCegarLoop]: === Iteration 86 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:42,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:42,429 INFO L82 PathProgramCache]: Analyzing trace with hash 311316660, now seen corresponding path program 1 times [2018-12-03 17:26:42,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:42,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:42,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:42,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:42,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:42,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:26:42,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:26:42,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:26:42,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:26:42,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:26:42,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:26:42,537 INFO L87 Difference]: Start difference. First operand 1683 states and 5340 transitions. Second operand 10 states. [2018-12-03 17:26:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:59,545 INFO L93 Difference]: Finished difference Result 3012 states and 8515 transitions. [2018-12-03 17:26:59,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:26:59,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:26:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:59,551 INFO L225 Difference]: With dead ends: 3012 [2018-12-03 17:26:59,551 INFO L226 Difference]: Without dead ends: 3003 [2018-12-03 17:26:59,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:26:59,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2018-12-03 17:27:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 1674. [2018-12-03 17:27:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2018-12-03 17:27:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 5309 transitions. [2018-12-03 17:27:04,378 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 5309 transitions. Word has length 11 [2018-12-03 17:27:04,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:04,379 INFO L480 AbstractCegarLoop]: Abstraction has 1674 states and 5309 transitions. [2018-12-03 17:27:04,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:27:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 5309 transitions. [2018-12-03 17:27:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:27:04,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:04,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:04,381 INFO L423 AbstractCegarLoop]: === Iteration 87 === [productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:04,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:04,381 INFO L82 PathProgramCache]: Analyzing trace with hash 311316663, now seen corresponding path program 1 times [2018-12-03 17:27:04,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:04,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:04,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:04,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:04,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:04,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:27:04,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 17:27:04,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:04,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:27:04,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:27:04,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:27:04,489 INFO L87 Difference]: Start difference. First operand 1674 states and 5309 transitions. Second operand 10 states.