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_out2.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:13:21,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:13:21,288 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:13:21,300 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:13:21,301 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:13:21,302 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:13:21,303 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:13:21,305 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:13:21,306 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:13:21,307 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:13:21,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:13:21,308 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:13:21,309 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:13:21,310 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:13:21,311 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:13:21,312 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:13:21,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:13:21,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:13:21,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:13:21,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:13:21,320 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:13:21,321 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:13:21,323 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:13:21,324 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:13:21,324 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:13:21,325 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:13:21,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:13:21,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:13:21,328 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:13:21,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:13:21,329 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:13:21,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:13:21,330 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:13:21,330 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:13:21,331 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:13:21,337 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:13:21,337 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,361 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:13:21,361 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:13:21,363 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:13:21,363 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:13:21,363 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:13:21,363 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:13:21,363 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:13:21,364 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:13:21,364 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:13:21,364 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:13:21,364 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:13:21,364 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:13:21,365 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:13:21,366 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:13:21,366 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:13:21,366 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:13:21,366 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:13:21,367 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:13:21,368 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:13:21,368 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:13:21,369 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:13:21,369 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:13:21,369 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:13:21,369 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:13:21,369 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:13:21,369 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:13:21,370 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:13:21,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:13:21,371 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:13:21,371 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:13:21,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:13:21,371 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:13:21,371 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:13:21,372 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:13:21,372 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:13:21,372 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:13:21,372 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:13:21,372 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:13:21,373 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:13:21,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:13:21,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:13:21,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:13:21,439 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:13:21,439 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:13:21,441 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl [2018-12-03 17:13:21,441 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2018-12-03 17:13:21,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:13:21,497 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:13:21,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:21,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:13:21,498 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:13:21,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,532 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 17:13:21,533 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 17:13:21,533 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 17:13:21,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:21,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:13:21,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:13:21,536 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:13:21,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/1) ... [2018-12-03 17:13:21,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:13:21,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:13:21,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:13:21,568 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:13:21,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out2.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,638 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 17:13:21,638 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 17:13:21,638 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 17:13:22,271 INFO L272 CfgBuilder]: Using library mode [2018-12-03 17:13:22,272 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:13:22,272 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:22 BoogieIcfgContainer [2018-12-03 17:13:22,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:13:22,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:13:22,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:13:22,277 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:13:22,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:21" (1/2) ... [2018-12-03 17:13:22,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b004760 and model type threadpooling_out2.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,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:22" (2/2) ... [2018-12-03 17:13:22,281 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2018-12-03 17:13:22,291 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:13:22,300 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-12-03 17:13:22,318 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-12-03 17:13:22,350 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:13:22,350 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:13:22,351 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:13:22,351 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:13:22,351 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:13:22,351 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:13:22,351 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:13:22,351 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:13:22,366 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-12-03 17:13:22,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:13:22,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:22,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 17:13:22,377 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:22,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:22,384 INFO L82 PathProgramCache]: Analyzing trace with hash 28852717, now seen corresponding path program 1 times [2018-12-03 17:13:22,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:22,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:22,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:22,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:22,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:22,622 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:22,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:22,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:22,624 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:22,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:13:22,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:13:22,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:13:22,646 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-12-03 17:13:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:23,325 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2018-12-03 17:13:23,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:13:23,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 17:13:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:23,341 INFO L225 Difference]: With dead ends: 46 [2018-12-03 17:13:23,341 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 17:13:23,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:13:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 17:13:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2018-12-03 17:13:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 17:13:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2018-12-03 17:13:23,394 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 5 [2018-12-03 17:13:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:23,394 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 56 transitions. [2018-12-03 17:13:23,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:13:23,395 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 56 transitions. [2018-12-03 17:13:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:13:23,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:23,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 17:13:23,397 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:23,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:23,397 INFO L82 PathProgramCache]: Analyzing trace with hash 32260834, now seen corresponding path program 1 times [2018-12-03 17:13:23,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:23,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:23,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:23,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:23,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:23,642 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-12-03 17:13:23,695 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,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:23,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:23,696 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:23,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:13:23,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:13:23,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:13:23,699 INFO L87 Difference]: Start difference. First operand 30 states and 56 transitions. Second operand 5 states. [2018-12-03 17:13:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:24,648 INFO L93 Difference]: Finished difference Result 75 states and 142 transitions. [2018-12-03 17:13:24,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:13:24,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 17:13:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:24,654 INFO L225 Difference]: With dead ends: 75 [2018-12-03 17:13:24,654 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 17:13:24,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 17:13:24,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2018-12-03 17:13:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 17:13:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 113 transitions. [2018-12-03 17:13:24,693 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 113 transitions. Word has length 5 [2018-12-03 17:13:24,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:24,694 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 113 transitions. [2018-12-03 17:13:24,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:13:24,694 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 113 transitions. [2018-12-03 17:13:24,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:24,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:24,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:24,696 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:24,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:24,696 INFO L82 PathProgramCache]: Analyzing trace with hash -737820031, now seen corresponding path program 1 times [2018-12-03 17:13:24,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:24,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:24,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:24,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:24,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:24,828 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:24,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:24,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:24,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:24,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:13:24,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:13:24,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:13:24,831 INFO L87 Difference]: Start difference. First operand 52 states and 113 transitions. Second operand 7 states. [2018-12-03 17:13:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:26,045 INFO L93 Difference]: Finished difference Result 198 states and 420 transitions. [2018-12-03 17:13:26,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:13:26,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:13:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:26,050 INFO L225 Difference]: With dead ends: 198 [2018-12-03 17:13:26,050 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 17:13:26,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:13:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 17:13:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 89. [2018-12-03 17:13:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 17:13:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 194 transitions. [2018-12-03 17:13:26,079 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 194 transitions. Word has length 8 [2018-12-03 17:13:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:26,080 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 194 transitions. [2018-12-03 17:13:26,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:13:26,080 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 194 transitions. [2018-12-03 17:13:26,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:26,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:26,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:26,082 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:26,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:26,082 INFO L82 PathProgramCache]: Analyzing trace with hash -791588849, now seen corresponding path program 1 times [2018-12-03 17:13:26,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:26,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:26,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:26,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:26,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:26,174 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:26,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:26,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:26,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:26,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:13:26,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:13:26,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:13:26,177 INFO L87 Difference]: Start difference. First operand 89 states and 194 transitions. Second operand 7 states. [2018-12-03 17:13:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:27,360 INFO L93 Difference]: Finished difference Result 227 states and 433 transitions. [2018-12-03 17:13:27,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:13:27,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:13:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:27,365 INFO L225 Difference]: With dead ends: 227 [2018-12-03 17:13:27,365 INFO L226 Difference]: Without dead ends: 223 [2018-12-03 17:13:27,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:13:27,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-12-03 17:13:27,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 112. [2018-12-03 17:13:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 17:13:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 252 transitions. [2018-12-03 17:13:27,400 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 252 transitions. Word has length 8 [2018-12-03 17:13:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:27,400 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 252 transitions. [2018-12-03 17:13:27,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:13:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 252 transitions. [2018-12-03 17:13:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:27,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:27,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:27,402 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:27,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:27,403 INFO L82 PathProgramCache]: Analyzing trace with hash 558061441, now seen corresponding path program 1 times [2018-12-03 17:13:27,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:27,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:27,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:27,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:27,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:27,524 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,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:27,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:27,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:27,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:13:27,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:13:27,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:13:27,527 INFO L87 Difference]: Start difference. First operand 112 states and 252 transitions. Second operand 7 states. [2018-12-03 17:13:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:29,248 INFO L93 Difference]: Finished difference Result 286 states and 570 transitions. [2018-12-03 17:13:29,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:13:29,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:13:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:29,251 INFO L225 Difference]: With dead ends: 286 [2018-12-03 17:13:29,251 INFO L226 Difference]: Without dead ends: 282 [2018-12-03 17:13:29,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:13:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-03 17:13:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 156. [2018-12-03 17:13:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 17:13:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 365 transitions. [2018-12-03 17:13:29,295 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 365 transitions. Word has length 8 [2018-12-03 17:13:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:29,295 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 365 transitions. [2018-12-03 17:13:29,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:13:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 365 transitions. [2018-12-03 17:13:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:29,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:29,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:29,298 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:29,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:29,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1066417550, now seen corresponding path program 1 times [2018-12-03 17:13:29,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:29,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:29,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:29,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:29,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:29,410 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:29,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:29,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:29,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:29,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:13:29,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:13:29,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:13:29,412 INFO L87 Difference]: Start difference. First operand 156 states and 365 transitions. Second operand 7 states. [2018-12-03 17:13:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:31,343 INFO L93 Difference]: Finished difference Result 351 states and 749 transitions. [2018-12-03 17:13:31,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:13:31,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:13:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:31,347 INFO L225 Difference]: With dead ends: 351 [2018-12-03 17:13:31,347 INFO L226 Difference]: Without dead ends: 347 [2018-12-03 17:13:31,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:13:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-12-03 17:13:31,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 202. [2018-12-03 17:13:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 17:13:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 490 transitions. [2018-12-03 17:13:31,398 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 490 transitions. Word has length 8 [2018-12-03 17:13:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:31,399 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 490 transitions. [2018-12-03 17:13:31,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:13:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 490 transitions. [2018-12-03 17:13:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:31,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:31,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:31,401 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:31,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:31,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1120186368, now seen corresponding path program 1 times [2018-12-03 17:13:31,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:31,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:31,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:31,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:31,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:31,876 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:31,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:31,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:31,877 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:31,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:13:31,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:13:31,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:13:31,878 INFO L87 Difference]: Start difference. First operand 202 states and 490 transitions. Second operand 7 states. [2018-12-03 17:13:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:32,856 INFO L93 Difference]: Finished difference Result 353 states and 758 transitions. [2018-12-03 17:13:32,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:13:32,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:13:32,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:32,861 INFO L225 Difference]: With dead ends: 353 [2018-12-03 17:13:32,861 INFO L226 Difference]: Without dead ends: 349 [2018-12-03 17:13:32,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:13:32,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-03 17:13:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 207. [2018-12-03 17:13:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 17:13:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 504 transitions. [2018-12-03 17:13:32,913 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 504 transitions. Word has length 8 [2018-12-03 17:13:32,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:32,913 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 504 transitions. [2018-12-03 17:13:32,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:13:32,913 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 504 transitions. [2018-12-03 17:13:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:32,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:32,915 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-03 17:13:32,915 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:32,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:32,915 INFO L82 PathProgramCache]: Analyzing trace with hash -990082056, now seen corresponding path program 1 times [2018-12-03 17:13:32,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:32,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:32,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:32,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:32,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:32,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:33,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:33,001 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 17:13:33,002 INFO L205 CegarAbsIntRunner]: [0], [57], [61], [95], [96], [120] [2018-12-03 17:13:33,058 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:33,059 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:33,240 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:13:33,242 INFO L272 AbstractInterpreter]: Visited 6 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:13:33,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:33,259 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:13:33,348 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-12-03 17:13:33,349 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:13:33,611 INFO L418 sIntCurrentIteration]: We unified 7 AI predicates to 7 [2018-12-03 17:13:33,612 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:13:33,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:13:33,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 10 [2018-12-03 17:13:33,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:33,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:33,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:33,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:33,614 INFO L87 Difference]: Start difference. First operand 207 states and 504 transitions. Second operand 8 states. [2018-12-03 17:13:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:36,256 INFO L93 Difference]: Finished difference Result 425 states and 1006 transitions. [2018-12-03 17:13:36,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:13:36,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:13:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:36,259 INFO L225 Difference]: With dead ends: 425 [2018-12-03 17:13:36,259 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 17:13:36,262 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:13:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 17:13:36,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2018-12-03 17:13:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-03 17:13:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 462 transitions. [2018-12-03 17:13:36,328 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 462 transitions. Word has length 8 [2018-12-03 17:13:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:36,328 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 462 transitions. [2018-12-03 17:13:36,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 462 transitions. [2018-12-03 17:13:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:13:36,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:36,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:36,330 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:36,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:36,331 INFO L82 PathProgramCache]: Analyzing trace with hash -990897365, now seen corresponding path program 1 times [2018-12-03 17:13:36,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:36,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:36,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:36,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:36,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:36,425 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,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:36,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:13:36,426 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:36,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:13:36,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:13:36,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:13:36,427 INFO L87 Difference]: Start difference. First operand 195 states and 462 transitions. Second operand 7 states. [2018-12-03 17:13:37,100 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-03 17:13:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:38,867 INFO L93 Difference]: Finished difference Result 384 states and 825 transitions. [2018-12-03 17:13:38,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:13:38,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:13:38,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:38,870 INFO L225 Difference]: With dead ends: 384 [2018-12-03 17:13:38,870 INFO L226 Difference]: Without dead ends: 380 [2018-12-03 17:13:38,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:13:38,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-12-03 17:13:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 255. [2018-12-03 17:13:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-03 17:13:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 604 transitions. [2018-12-03 17:13:38,963 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 604 transitions. Word has length 8 [2018-12-03 17:13:38,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:38,963 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 604 transitions. [2018-12-03 17:13:38,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:13:38,963 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 604 transitions. [2018-12-03 17:13:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:13:38,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:38,964 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:38,965 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:38,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:38,965 INFO L82 PathProgramCache]: Analyzing trace with hash -574525708, now seen corresponding path program 1 times [2018-12-03 17:13:38,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:38,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:38,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:38,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:39,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:39,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:39,224 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 17:13:39,225 INFO L205 CegarAbsIntRunner]: [0], [7], [15], [19], [29], [86], [110], [112], [114] [2018-12-03 17:13:39,226 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:39,226 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:39,234 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:13:39,234 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Never found a fixpoint. Largest state had 0 variables. [2018-12-03 17:13:39,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:39,272 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:13:39,291 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 66.05% of their original sizes. [2018-12-03 17:13:39,291 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:13:39,453 INFO L418 sIntCurrentIteration]: We unified 9 AI predicates to 9 [2018-12-03 17:13:39,453 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:13:39,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:13:39,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 15 [2018-12-03 17:13:39,454 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:39,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:13:39,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:13:39,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:13:39,456 INFO L87 Difference]: Start difference. First operand 255 states and 604 transitions. Second operand 10 states. [2018-12-03 17:13:42,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:42,690 INFO L93 Difference]: Finished difference Result 583 states and 1332 transitions. [2018-12-03 17:13:42,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:13:42,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 17:13:42,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:42,693 INFO L225 Difference]: With dead ends: 583 [2018-12-03 17:13:42,693 INFO L226 Difference]: Without dead ends: 371 [2018-12-03 17:13:42,694 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:13:42,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-12-03 17:13:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 296. [2018-12-03 17:13:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-03 17:13:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 697 transitions. [2018-12-03 17:13:42,806 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 697 transitions. Word has length 10 [2018-12-03 17:13:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:42,807 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 697 transitions. [2018-12-03 17:13:42,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:13:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 697 transitions. [2018-12-03 17:13:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:13:42,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:42,808 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:42,809 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:42,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:42,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1246182800, now seen corresponding path program 1 times [2018-12-03 17:13:42,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:42,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:42,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:42,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:42,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:42,926 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:13:42,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:42,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:13:42,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:42,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:13:42,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:13:42,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:13:42,930 INFO L87 Difference]: Start difference. First operand 296 states and 697 transitions. Second operand 4 states. [2018-12-03 17:13:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:43,174 INFO L93 Difference]: Finished difference Result 543 states and 1287 transitions. [2018-12-03 17:13:43,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:13:43,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-03 17:13:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:43,177 INFO L225 Difference]: With dead ends: 543 [2018-12-03 17:13:43,177 INFO L226 Difference]: Without dead ends: 290 [2018-12-03 17:13:43,178 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:13:43,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-03 17:13:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2018-12-03 17:13:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-03 17:13:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 628 transitions. [2018-12-03 17:13:43,287 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 628 transitions. Word has length 11 [2018-12-03 17:13:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:43,287 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 628 transitions. [2018-12-03 17:13:43,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:13:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 628 transitions. [2018-12-03 17:13:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:13:43,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:43,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:43,288 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:43,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1246305901, now seen corresponding path program 1 times [2018-12-03 17:13:43,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:43,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:43,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:43,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:43,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:43,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:43,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:43,391 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 17:13:43,392 INFO L205 CegarAbsIntRunner]: [0], [7], [76], [80], [86], [90], [102], [106], [110], [114], [117] [2018-12-03 17:13:43,393 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:43,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:43,398 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:13:43,398 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Never found a fixpoint. Largest state had 0 variables. [2018-12-03 17:13:43,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:43,435 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:13:43,451 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 58.64% of their original sizes. [2018-12-03 17:13:43,452 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:13:43,609 INFO L418 sIntCurrentIteration]: We unified 10 AI predicates to 10 [2018-12-03 17:13:43,610 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:13:43,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:13:43,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 16 [2018-12-03 17:13:43,610 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:43,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:13:43,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:13:43,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:13:43,612 INFO L87 Difference]: Start difference. First operand 280 states and 628 transitions. Second operand 10 states. [2018-12-03 17:13:47,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:47,264 INFO L93 Difference]: Finished difference Result 552 states and 1206 transitions. [2018-12-03 17:13:47,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:13:47,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:13:47,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:47,266 INFO L225 Difference]: With dead ends: 552 [2018-12-03 17:13:47,267 INFO L226 Difference]: Without dead ends: 315 [2018-12-03 17:13:47,267 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:13:47,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-03 17:13:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 272. [2018-12-03 17:13:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-12-03 17:13:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 597 transitions. [2018-12-03 17:13:47,355 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 597 transitions. Word has length 11 [2018-12-03 17:13:47,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:47,355 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 597 transitions. [2018-12-03 17:13:47,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:13:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 597 transitions. [2018-12-03 17:13:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:13:47,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:47,356 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:47,356 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:47,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:47,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1753761858, now seen corresponding path program 1 times [2018-12-03 17:13:47,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:47,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:47,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:47,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:47,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:47,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:47,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:47,425 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 17:13:47,425 INFO L205 CegarAbsIntRunner]: [0], [7], [76], [80], [86], [93], [102], [106], [117] [2018-12-03 17:13:47,426 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:47,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:47,430 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:13:47,430 INFO L272 AbstractInterpreter]: Visited 9 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:13:47,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:47,431 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:13:47,450 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 53.33% of their original sizes. [2018-12-03 17:13:47,450 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:13:47,624 INFO L418 sIntCurrentIteration]: We unified 10 AI predicates to 10 [2018-12-03 17:13:47,624 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:13:47,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:13:47,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 16 [2018-12-03 17:13:47,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:47,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:13:47,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:13:47,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:13:47,626 INFO L87 Difference]: Start difference. First operand 272 states and 597 transitions. Second operand 12 states. [2018-12-03 17:13:51,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:51,013 INFO L93 Difference]: Finished difference Result 638 states and 1348 transitions. [2018-12-03 17:13:51,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:13:51,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 17:13:51,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:51,015 INFO L225 Difference]: With dead ends: 638 [2018-12-03 17:13:51,016 INFO L226 Difference]: Without dead ends: 406 [2018-12-03 17:13:51,017 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:13:51,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-12-03 17:13:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 281. [2018-12-03 17:13:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-12-03 17:13:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 612 transitions. [2018-12-03 17:13:51,134 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 612 transitions. Word has length 11 [2018-12-03 17:13:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:51,134 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 612 transitions. [2018-12-03 17:13:51,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:13:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 612 transitions. [2018-12-03 17:13:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:13:51,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:51,136 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:51,136 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:51,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:51,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1442250271, now seen corresponding path program 1 times [2018-12-03 17:13:51,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:51,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:51,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:51,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:51,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:51,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:51,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:51,241 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 17:13:51,242 INFO L205 CegarAbsIntRunner]: [0], [7], [44], [86], [90], [98], [110], [114], [117] [2018-12-03 17:13:51,242 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:51,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:51,247 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:13:51,247 INFO L272 AbstractInterpreter]: Visited 9 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:13:51,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:51,252 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:13:51,272 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 65% of their original sizes. [2018-12-03 17:13:51,272 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:13:51,453 INFO L418 sIntCurrentIteration]: We unified 10 AI predicates to 10 [2018-12-03 17:13:51,453 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:13:51,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:13:51,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 16 [2018-12-03 17:13:51,454 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:51,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:13:51,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:13:51,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:13:51,455 INFO L87 Difference]: Start difference. First operand 281 states and 612 transitions. Second operand 11 states. [2018-12-03 17:13:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:57,237 INFO L93 Difference]: Finished difference Result 585 states and 1236 transitions. [2018-12-03 17:13:57,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:13:57,237 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:13:57,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:57,239 INFO L225 Difference]: With dead ends: 585 [2018-12-03 17:13:57,239 INFO L226 Difference]: Without dead ends: 356 [2018-12-03 17:13:57,240 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:13:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-12-03 17:13:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 293. [2018-12-03 17:13:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-12-03 17:13:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 629 transitions. [2018-12-03 17:13:57,382 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 629 transitions. Word has length 11 [2018-12-03 17:13:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:57,382 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 629 transitions. [2018-12-03 17:13:57,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:13:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 629 transitions. [2018-12-03 17:13:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:13:57,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:57,383 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:57,383 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:57,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:57,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1737860601, now seen corresponding path program 1 times [2018-12-03 17:13:57,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:57,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:57,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:57,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:57,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:57,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:57,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:57,793 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 17:13:57,793 INFO L205 CegarAbsIntRunner]: [0], [7], [15], [17], [19], [26], [92], [102], [106], [117] [2018-12-03 17:13:57,795 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:57,795 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:57,813 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:13:57,814 INFO L272 AbstractInterpreter]: Visited 10 different actions 21 times. Merged at 7 different actions 7 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:13:57,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:57,849 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:13:57,895 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 53.89% of their original sizes. [2018-12-03 17:13:57,895 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:13:58,269 INFO L418 sIntCurrentIteration]: We unified 10 AI predicates to 10 [2018-12-03 17:13:58,269 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:13:58,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:13:58,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 17 [2018-12-03 17:13:58,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:58,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:13:58,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:13:58,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:13:58,271 INFO L87 Difference]: Start difference. First operand 293 states and 629 transitions. Second operand 12 states. [2018-12-03 17:14:05,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:05,541 INFO L93 Difference]: Finished difference Result 692 states and 1424 transitions. [2018-12-03 17:14:05,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:14:05,541 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 17:14:05,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:05,543 INFO L225 Difference]: With dead ends: 692 [2018-12-03 17:14:05,544 INFO L226 Difference]: Without dead ends: 476 [2018-12-03 17:14:05,544 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:14:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-12-03 17:14:05,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 368. [2018-12-03 17:14:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-12-03 17:14:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 789 transitions. [2018-12-03 17:14:05,710 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 789 transitions. Word has length 11 [2018-12-03 17:14:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:05,710 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 789 transitions. [2018-12-03 17:14:05,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:14:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 789 transitions. [2018-12-03 17:14:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:14:05,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:05,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:05,712 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:05,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:05,712 INFO L82 PathProgramCache]: Analyzing trace with hash 228084956, now seen corresponding path program 1 times [2018-12-03 17:14:05,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:05,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:05,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:05,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:05,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:05,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:05,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:14:05,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:05,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:14:05,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:14:05,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:14:05,775 INFO L87 Difference]: Start difference. First operand 368 states and 789 transitions. Second operand 4 states. [2018-12-03 17:14:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:05,950 INFO L93 Difference]: Finished difference Result 618 states and 1323 transitions. [2018-12-03 17:14:05,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:14:05,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-03 17:14:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:05,952 INFO L225 Difference]: With dead ends: 618 [2018-12-03 17:14:05,952 INFO L226 Difference]: Without dead ends: 286 [2018-12-03 17:14:05,953 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:14:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-03 17:14:06,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 231. [2018-12-03 17:14:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-03 17:14:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 462 transitions. [2018-12-03 17:14:06,063 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 462 transitions. Word has length 11 [2018-12-03 17:14:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:06,063 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 462 transitions. [2018-12-03 17:14:06,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:14:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 462 transitions. [2018-12-03 17:14:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:14:06,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:06,064 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:06,064 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:06,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:06,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1883568488, now seen corresponding path program 1 times [2018-12-03 17:14:06,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:06,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:06,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:06,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:06,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:06,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:06,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:06,152 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 17:14:06,152 INFO L205 CegarAbsIntRunner]: [0], [35], [44], [53], [57], [59], [61], [96], [98], [120] [2018-12-03 17:14:06,153 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:06,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:06,162 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:06,162 INFO L272 AbstractInterpreter]: Visited 10 different actions 22 times. Merged at 7 different actions 8 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:14:06,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:06,205 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:06,217 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 47.22% of their original sizes. [2018-12-03 17:14:06,217 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:06,321 INFO L418 sIntCurrentIteration]: We unified 10 AI predicates to 10 [2018-12-03 17:14:06,322 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:06,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:06,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 18 [2018-12-03 17:14:06,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:06,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:14:06,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:14:06,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:14:06,323 INFO L87 Difference]: Start difference. First operand 231 states and 462 transitions. Second operand 12 states. [2018-12-03 17:14:08,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:08,216 INFO L93 Difference]: Finished difference Result 440 states and 824 transitions. [2018-12-03 17:14:08,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:14:08,217 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 17:14:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:08,219 INFO L225 Difference]: With dead ends: 440 [2018-12-03 17:14:08,219 INFO L226 Difference]: Without dead ends: 436 [2018-12-03 17:14:08,220 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:14:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-12-03 17:14:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 333. [2018-12-03 17:14:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-12-03 17:14:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 682 transitions. [2018-12-03 17:14:08,399 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 682 transitions. Word has length 11 [2018-12-03 17:14:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:08,399 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 682 transitions. [2018-12-03 17:14:08,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:14:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 682 transitions. [2018-12-03 17:14:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:08,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:08,400 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:08,400 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:08,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:08,400 INFO L82 PathProgramCache]: Analyzing trace with hash -442294699, now seen corresponding path program 1 times [2018-12-03 17:14:08,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:08,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:08,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:08,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:08,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:08,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:08,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:08,495 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 17:14:08,495 INFO L205 CegarAbsIntRunner]: [0], [7], [76], [80], [86], [93], [102], [104], [106], [117] [2018-12-03 17:14:08,496 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:08,496 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:08,531 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:08,532 INFO L272 AbstractInterpreter]: Visited 10 different actions 50 times. Merged at 7 different actions 29 times. Widened at 4 different actions 7 times. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:14:08,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:08,537 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:08,554 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 49.54% of their original sizes. [2018-12-03 17:14:08,554 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:08,764 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 17:14:08,765 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:08,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:08,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 20 [2018-12-03 17:14:08,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:08,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:14:08,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:14:08,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:14:08,767 INFO L87 Difference]: Start difference. First operand 333 states and 682 transitions. Second operand 14 states. [2018-12-03 17:14:11,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:11,035 INFO L93 Difference]: Finished difference Result 658 states and 1317 transitions. [2018-12-03 17:14:11,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:14:11,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 17:14:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:11,037 INFO L225 Difference]: With dead ends: 658 [2018-12-03 17:14:11,037 INFO L226 Difference]: Without dead ends: 412 [2018-12-03 17:14:11,038 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:14:11,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-12-03 17:14:11,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 317. [2018-12-03 17:14:11,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-12-03 17:14:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 640 transitions. [2018-12-03 17:14:11,293 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 640 transitions. Word has length 13 [2018-12-03 17:14:11,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:11,293 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 640 transitions. [2018-12-03 17:14:11,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:14:11,294 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 640 transitions. [2018-12-03 17:14:11,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:11,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:11,295 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:11,295 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:11,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:11,295 INFO L82 PathProgramCache]: Analyzing trace with hash -496063517, now seen corresponding path program 1 times [2018-12-03 17:14:11,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:11,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:11,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:11,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:11,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:11,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:11,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:11,622 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 17:14:11,622 INFO L205 CegarAbsIntRunner]: [0], [7], [44], [86], [93], [98], [102], [104], [106], [110], [114], [117] [2018-12-03 17:14:11,623 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:11,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:11,664 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:11,664 INFO L272 AbstractInterpreter]: Visited 12 different actions 68 times. Merged at 9 different actions 42 times. Widened at 4 different actions 9 times. Found 12 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:14:11,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:11,698 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:11,710 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 49.54% of their original sizes. [2018-12-03 17:14:11,710 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:11,940 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 17:14:11,940 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:11,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:11,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 20 [2018-12-03 17:14:11,941 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:11,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:14:11,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:14:11,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:14:11,942 INFO L87 Difference]: Start difference. First operand 317 states and 640 transitions. Second operand 14 states. [2018-12-03 17:14:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:13,787 INFO L93 Difference]: Finished difference Result 492 states and 956 transitions. [2018-12-03 17:14:13,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:14:13,788 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 17:14:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:13,790 INFO L225 Difference]: With dead ends: 492 [2018-12-03 17:14:13,790 INFO L226 Difference]: Without dead ends: 488 [2018-12-03 17:14:13,790 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:14:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-12-03 17:14:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 321. [2018-12-03 17:14:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-12-03 17:14:14,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 649 transitions. [2018-12-03 17:14:14,004 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 649 transitions. Word has length 13 [2018-12-03 17:14:14,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:14,004 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 649 transitions. [2018-12-03 17:14:14,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:14:14,004 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 649 transitions. [2018-12-03 17:14:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:14,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:14,005 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:14,005 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:14,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:14,006 INFO L82 PathProgramCache]: Analyzing trace with hash 29493065, now seen corresponding path program 1 times [2018-12-03 17:14:14,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:14,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:14,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:14,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:14,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:14,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:14,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:14,167 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 17:14:14,167 INFO L205 CegarAbsIntRunner]: [0], [53], [68], [76], [78], [80], [86], [87], [102], [106], [120] [2018-12-03 17:14:14,168 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:14,168 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:14,188 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:14,189 INFO L272 AbstractInterpreter]: Visited 11 different actions 39 times. Merged at 5 different actions 18 times. Widened at 2 different actions 3 times. Found 8 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:14:14,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:14,192 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:14,202 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 60.65% of their original sizes. [2018-12-03 17:14:14,202 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:14,334 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 17:14:14,334 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:14,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:14,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 17:14:14,334 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:14,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:14:14,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:14:14,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:14:14,335 INFO L87 Difference]: Start difference. First operand 321 states and 649 transitions. Second operand 13 states. [2018-12-03 17:14:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:17,616 INFO L93 Difference]: Finished difference Result 709 states and 1383 transitions. [2018-12-03 17:14:17,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:14:17,616 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 17:14:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:17,618 INFO L225 Difference]: With dead ends: 709 [2018-12-03 17:14:17,618 INFO L226 Difference]: Without dead ends: 440 [2018-12-03 17:14:17,619 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:14:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-12-03 17:14:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 280. [2018-12-03 17:14:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-03 17:14:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 539 transitions. [2018-12-03 17:14:17,809 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 539 transitions. Word has length 13 [2018-12-03 17:14:17,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:17,809 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 539 transitions. [2018-12-03 17:14:17,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:14:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 539 transitions. [2018-12-03 17:14:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:17,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:17,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:17,810 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:17,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:17,810 INFO L82 PathProgramCache]: Analyzing trace with hash 2013337286, now seen corresponding path program 1 times [2018-12-03 17:14:17,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:17,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:17,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:17,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:17,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:17,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:17,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:17,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:17,907 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 17:14:17,907 INFO L205 CegarAbsIntRunner]: [0], [36], [44], [53], [68], [76], [78], [80], [86], [98], [102], [106], [120] [2018-12-03 17:14:17,909 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:17,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:17,917 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:17,917 INFO L272 AbstractInterpreter]: Visited 13 different actions 23 times. Merged at 6 different actions 7 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 17:14:17,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:17,919 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:17,936 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 50.93% of their original sizes. [2018-12-03 17:14:17,936 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:18,160 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 17:14:18,161 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:18,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:18,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 19 [2018-12-03 17:14:18,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:18,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:14:18,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:14:18,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:14:18,163 INFO L87 Difference]: Start difference. First operand 280 states and 539 transitions. Second operand 14 states. [2018-12-03 17:14:21,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:21,060 INFO L93 Difference]: Finished difference Result 680 states and 1274 transitions. [2018-12-03 17:14:21,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:14:21,060 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 17:14:21,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:21,061 INFO L225 Difference]: With dead ends: 680 [2018-12-03 17:14:21,062 INFO L226 Difference]: Without dead ends: 417 [2018-12-03 17:14:21,062 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:14:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-03 17:14:21,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 278. [2018-12-03 17:14:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-03 17:14:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 535 transitions. [2018-12-03 17:14:21,256 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 535 transitions. Word has length 13 [2018-12-03 17:14:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:21,256 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 535 transitions. [2018-12-03 17:14:21,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:14:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 535 transitions. [2018-12-03 17:14:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:21,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:21,257 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:21,258 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:21,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:21,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1936277035, now seen corresponding path program 1 times [2018-12-03 17:14:21,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:21,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:21,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:21,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:21,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:21,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:21,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:21,350 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 17:14:21,350 INFO L205 CegarAbsIntRunner]: [0], [36], [44], [46], [53], [76], [80], [86], [98], [102], [106], [120] [2018-12-03 17:14:21,351 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:21,351 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:21,395 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:21,395 INFO L272 AbstractInterpreter]: Visited 12 different actions 68 times. Merged at 9 different actions 42 times. Widened at 4 different actions 9 times. Found 12 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:14:21,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:21,418 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:21,432 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 49.54% of their original sizes. [2018-12-03 17:14:21,432 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:21,585 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 17:14:21,585 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:21,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:21,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 19 [2018-12-03 17:14:21,586 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:21,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:14:21,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:14:21,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:14:21,587 INFO L87 Difference]: Start difference. First operand 278 states and 535 transitions. Second operand 14 states. [2018-12-03 17:14:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:23,595 INFO L93 Difference]: Finished difference Result 712 states and 1326 transitions. [2018-12-03 17:14:23,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:14:23,596 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 17:14:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:23,598 INFO L225 Difference]: With dead ends: 712 [2018-12-03 17:14:23,598 INFO L226 Difference]: Without dead ends: 451 [2018-12-03 17:14:23,599 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:14:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-12-03 17:14:23,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 278. [2018-12-03 17:14:23,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-03 17:14:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 528 transitions. [2018-12-03 17:14:23,799 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 528 transitions. Word has length 13 [2018-12-03 17:14:23,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:23,799 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 528 transitions. [2018-12-03 17:14:23,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:14:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 528 transitions. [2018-12-03 17:14:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:14:23,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:23,800 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:23,800 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:23,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:23,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1564094653, now seen corresponding path program 1 times [2018-12-03 17:14:23,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:23,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:23,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:23,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:23,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:23,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:23,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:23,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:23,889 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 17:14:23,890 INFO L205 CegarAbsIntRunner]: [0], [36], [44], [46], [53], [92], [98], [102], [106], [120] [2018-12-03 17:14:23,891 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:23,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:23,926 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:23,926 INFO L272 AbstractInterpreter]: Visited 10 different actions 58 times. Merged at 8 different actions 39 times. Widened at 4 different actions 10 times. Found 9 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:14:23,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:23,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:23,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:23,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:23,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:23,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:23,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:14:24,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:14:24,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:24,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2018-12-03 17:14:24,506 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:24,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:14:24,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:14:24,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:14:24,507 INFO L87 Difference]: Start difference. First operand 278 states and 528 transitions. Second operand 10 states. [2018-12-03 17:14:29,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:29,252 INFO L93 Difference]: Finished difference Result 552 states and 981 transitions. [2018-12-03 17:14:29,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:14:29,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2018-12-03 17:14:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:29,255 INFO L225 Difference]: With dead ends: 552 [2018-12-03 17:14:29,255 INFO L226 Difference]: Without dead ends: 548 [2018-12-03 17:14:29,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=285, Invalid=771, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:14:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-12-03 17:14:29,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 263. [2018-12-03 17:14:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-03 17:14:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 490 transitions. [2018-12-03 17:14:29,452 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 490 transitions. Word has length 14 [2018-12-03 17:14:29,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:29,452 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 490 transitions. [2018-12-03 17:14:29,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:14:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 490 transitions. [2018-12-03 17:14:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:14:29,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:29,453 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:29,453 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:29,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:29,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2111128198, now seen corresponding path program 1 times [2018-12-03 17:14:29,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:29,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:29,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:29,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:29,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:29,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:29,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:29,621 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:14:29,621 INFO L205 CegarAbsIntRunner]: [0], [7], [17], [76], [80], [87], [92], [93], [102], [104], [106], [117] [2018-12-03 17:14:29,622 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:29,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:29,664 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:29,664 INFO L272 AbstractInterpreter]: Visited 12 different actions 76 times. Merged at 10 different actions 37 times. Widened at 6 different actions 12 times. Found 22 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 17:14:29,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:29,705 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:29,723 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 47.04% of their original sizes. [2018-12-03 17:14:29,723 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:30,058 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:14:30,058 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:30,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:30,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [10] total 25 [2018-12-03 17:14:30,059 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:30,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:14:30,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:14:30,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:14:30,060 INFO L87 Difference]: Start difference. First operand 263 states and 490 transitions. Second operand 17 states. [2018-12-03 17:14:33,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:33,691 INFO L93 Difference]: Finished difference Result 498 states and 873 transitions. [2018-12-03 17:14:33,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:14:33,691 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 17:14:33,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:33,694 INFO L225 Difference]: With dead ends: 498 [2018-12-03 17:14:33,694 INFO L226 Difference]: Without dead ends: 494 [2018-12-03 17:14:33,695 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=373, Invalid=887, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:14:33,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-12-03 17:14:33,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 251. [2018-12-03 17:14:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-03 17:14:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 468 transitions. [2018-12-03 17:14:33,968 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 468 transitions. Word has length 16 [2018-12-03 17:14:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:33,968 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 468 transitions. [2018-12-03 17:14:33,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:14:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 468 transitions. [2018-12-03 17:14:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:14:33,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:33,969 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:33,969 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:33,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:33,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1869315507, now seen corresponding path program 1 times [2018-12-03 17:14:33,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:33,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:33,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:33,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:33,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:34,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:34,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:34,071 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:14:34,071 INFO L205 CegarAbsIntRunner]: [0], [7], [15], [17], [19], [26], [92], [93], [102], [104], [106], [117] [2018-12-03 17:14:34,072 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:34,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:34,106 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:34,106 INFO L272 AbstractInterpreter]: Visited 12 different actions 72 times. Merged at 9 different actions 35 times. Widened at 4 different actions 9 times. Found 23 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 17:14:34,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:34,109 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:34,121 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 41.85% of their original sizes. [2018-12-03 17:14:34,122 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:34,321 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:14:34,322 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:34,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:34,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 22 [2018-12-03 17:14:34,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:34,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:14:34,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:14:34,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:14:34,323 INFO L87 Difference]: Start difference. First operand 251 states and 468 transitions. Second operand 15 states. [2018-12-03 17:14:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:38,072 INFO L93 Difference]: Finished difference Result 889 states and 1634 transitions. [2018-12-03 17:14:38,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:14:38,072 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 17:14:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:38,075 INFO L225 Difference]: With dead ends: 889 [2018-12-03 17:14:38,075 INFO L226 Difference]: Without dead ends: 707 [2018-12-03 17:14:38,076 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=460, Invalid=1180, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:14:38,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-12-03 17:14:38,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 432. [2018-12-03 17:14:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-12-03 17:14:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 813 transitions. [2018-12-03 17:14:38,613 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 813 transitions. Word has length 16 [2018-12-03 17:14:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:38,613 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 813 transitions. [2018-12-03 17:14:38,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:14:38,613 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 813 transitions. [2018-12-03 17:14:38,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:14:38,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:38,614 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:38,614 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:38,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:38,615 INFO L82 PathProgramCache]: Analyzing trace with hash -128249041, now seen corresponding path program 1 times [2018-12-03 17:14:38,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:38,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:38,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:38,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:38,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:14:38,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:38,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:38,763 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:14:38,763 INFO L205 CegarAbsIntRunner]: [0], [7], [17], [35], [36], [44], [53], [93], [98], [102], [104], [106], [117], [120] [2018-12-03 17:14:38,764 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:38,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:38,825 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:38,825 INFO L272 AbstractInterpreter]: Visited 14 different actions 109 times. Merged at 12 different actions 60 times. Widened at 6 different actions 22 times. Found 34 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 17:14:38,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:38,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:38,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:38,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:38,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:38,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:38,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:14:38,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:14:39,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:39,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 19 [2018-12-03 17:14:39,027 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:39,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:14:39,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:14:39,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:14:39,028 INFO L87 Difference]: Start difference. First operand 432 states and 813 transitions. Second operand 16 states. [2018-12-03 17:14:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:42,311 INFO L93 Difference]: Finished difference Result 921 states and 1637 transitions. [2018-12-03 17:14:42,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:14:42,311 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 17:14:42,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:42,314 INFO L225 Difference]: With dead ends: 921 [2018-12-03 17:14:42,314 INFO L226 Difference]: Without dead ends: 917 [2018-12-03 17:14:42,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=644, Invalid=2436, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:14:42,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-12-03 17:14:42,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 264. [2018-12-03 17:14:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-03 17:14:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 490 transitions. [2018-12-03 17:14:42,779 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 490 transitions. Word has length 16 [2018-12-03 17:14:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:42,779 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 490 transitions. [2018-12-03 17:14:42,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:14:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 490 transitions. [2018-12-03 17:14:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:14:42,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:42,780 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:42,780 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:42,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:42,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1338195593, now seen corresponding path program 1 times [2018-12-03 17:14:42,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:42,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:42,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:42,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:42,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:42,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:42,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:42,886 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:14:42,886 INFO L205 CegarAbsIntRunner]: [0], [7], [17], [53], [76], [80], [87], [92], [93], [102], [104], [106], [117], [120] [2018-12-03 17:14:42,887 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:42,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:42,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:42,943 INFO L272 AbstractInterpreter]: Visited 14 different actions 105 times. Merged at 12 different actions 54 times. Widened at 6 different actions 17 times. Found 33 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 17:14:42,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:42,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:42,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:42,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:42,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:42,957 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:42,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:43,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:43,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:43,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 18 [2018-12-03 17:14:43,119 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:43,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:14:43,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:14:43,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:14:43,120 INFO L87 Difference]: Start difference. First operand 264 states and 490 transitions. Second operand 15 states. [2018-12-03 17:14:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:46,668 INFO L93 Difference]: Finished difference Result 691 states and 1219 transitions. [2018-12-03 17:14:46,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:14:46,669 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 17:14:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:46,671 INFO L225 Difference]: With dead ends: 691 [2018-12-03 17:14:46,671 INFO L226 Difference]: Without dead ends: 687 [2018-12-03 17:14:46,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=643, Invalid=2437, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:14:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-12-03 17:14:47,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 207. [2018-12-03 17:14:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 17:14:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 378 transitions. [2018-12-03 17:14:47,044 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 378 transitions. Word has length 16 [2018-12-03 17:14:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:47,044 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 378 transitions. [2018-12-03 17:14:47,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:14:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 378 transitions. [2018-12-03 17:14:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:14:47,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:47,045 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:47,045 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:47,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:47,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1776009746, now seen corresponding path program 1 times [2018-12-03 17:14:47,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:47,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:47,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:47,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:47,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:14:47,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:47,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:47,321 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:14:47,322 INFO L205 CegarAbsIntRunner]: [0], [36], [44], [46], [53], [57], [59], [61], [76], [80], [86], [96], [98], [102], [106], [120] [2018-12-03 17:14:47,322 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:47,323 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:47,385 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:47,385 INFO L272 AbstractInterpreter]: Visited 16 different actions 105 times. Merged at 14 different actions 59 times. Widened at 8 different actions 16 times. Found 29 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 17:14:47,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:47,389 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:47,403 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 43.79% of their original sizes. [2018-12-03 17:14:47,404 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:47,734 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 17:14:47,735 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:47,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:47,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [9] total 25 [2018-12-03 17:14:47,735 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:47,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:14:47,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:14:47,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:14:47,736 INFO L87 Difference]: Start difference. First operand 207 states and 378 transitions. Second operand 18 states. [2018-12-03 17:14:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:54,933 INFO L93 Difference]: Finished difference Result 988 states and 1777 transitions. [2018-12-03 17:14:54,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 17:14:54,933 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 17:14:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:54,937 INFO L225 Difference]: With dead ends: 988 [2018-12-03 17:14:54,937 INFO L226 Difference]: Without dead ends: 819 [2018-12-03 17:14:54,939 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1072, Invalid=3088, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 17:14:54,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-12-03 17:14:56,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 421. [2018-12-03 17:14:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 17:14:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 779 transitions. [2018-12-03 17:14:56,092 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 779 transitions. Word has length 18 [2018-12-03 17:14:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:56,093 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 779 transitions. [2018-12-03 17:14:56,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:14:56,093 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 779 transitions. [2018-12-03 17:14:56,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 17:14:56,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:56,094 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:56,094 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:56,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:56,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1414931401, now seen corresponding path program 1 times [2018-12-03 17:14:56,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:56,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:56,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:56,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:56,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:14:56,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:56,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:56,200 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 17:14:56,200 INFO L205 CegarAbsIntRunner]: [0], [7], [15], [17], [19], [26], [35], [44], [93], [98], [102], [104], [106], [117] [2018-12-03 17:14:56,201 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:56,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:56,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:56,243 INFO L272 AbstractInterpreter]: Visited 14 different actions 96 times. Merged at 13 different actions 57 times. Widened at 6 different actions 17 times. Found 25 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 17:14:56,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:56,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:56,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:56,248 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:56,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:56,257 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:56,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:14:56,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:14:56,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:56,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2018-12-03 17:14:56,707 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:56,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:14:56,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:14:56,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:14:56,708 INFO L87 Difference]: Start difference. First operand 421 states and 779 transitions. Second operand 14 states. [2018-12-03 17:14:57,807 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 17:15:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:02,857 INFO L93 Difference]: Finished difference Result 1301 states and 2312 transitions. [2018-12-03 17:15:02,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:15:02,857 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-12-03 17:15:02,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:02,863 INFO L225 Difference]: With dead ends: 1301 [2018-12-03 17:15:02,863 INFO L226 Difference]: Without dead ends: 1299 [2018-12-03 17:15:02,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=591, Invalid=1959, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 17:15:02,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2018-12-03 17:15:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 380. [2018-12-03 17:15:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-12-03 17:15:03,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 699 transitions. [2018-12-03 17:15:03,786 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 699 transitions. Word has length 19 [2018-12-03 17:15:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:03,787 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 699 transitions. [2018-12-03 17:15:03,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:15:03,787 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 699 transitions. [2018-12-03 17:15:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 17:15:03,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:03,788 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:03,788 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:03,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:03,788 INFO L82 PathProgramCache]: Analyzing trace with hash -254589569, now seen corresponding path program 1 times [2018-12-03 17:15:03,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:03,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:03,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:03,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:03,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:15:03,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:03,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:03,966 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 17:15:03,966 INFO L205 CegarAbsIntRunner]: [0], [7], [15], [17], [19], [26], [36], [44], [92], [93], [98], [102], [104], [106], [117] [2018-12-03 17:15:03,967 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:03,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:04,016 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:15:04,016 INFO L272 AbstractInterpreter]: Visited 15 different actions 98 times. Merged at 13 different actions 49 times. Widened at 6 different actions 14 times. Found 33 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 17:15:04,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:04,026 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:15:04,044 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 41.05% of their original sizes. [2018-12-03 17:15:04,045 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:15:04,370 INFO L418 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2018-12-03 17:15:04,370 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:15:04,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:15:04,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [9] total 25 [2018-12-03 17:15:04,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:04,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:15:04,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:15:04,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:15:04,372 INFO L87 Difference]: Start difference. First operand 380 states and 699 transitions. Second operand 18 states. [2018-12-03 17:15:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:11,273 INFO L93 Difference]: Finished difference Result 1289 states and 2289 transitions. [2018-12-03 17:15:11,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:15:11,273 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2018-12-03 17:15:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:11,277 INFO L225 Difference]: With dead ends: 1289 [2018-12-03 17:15:11,277 INFO L226 Difference]: Without dead ends: 1057 [2018-12-03 17:15:11,278 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=570, Invalid=1686, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:15:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-12-03 17:15:12,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 377. [2018-12-03 17:15:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-12-03 17:15:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 694 transitions. [2018-12-03 17:15:12,357 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 694 transitions. Word has length 19 [2018-12-03 17:15:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:12,358 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 694 transitions. [2018-12-03 17:15:12,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:15:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 694 transitions. [2018-12-03 17:15:12,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 17:15:12,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:12,359 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:12,359 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:12,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:12,360 INFO L82 PathProgramCache]: Analyzing trace with hash 225454455, now seen corresponding path program 1 times [2018-12-03 17:15:12,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:12,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:12,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:12,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:12,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:15:12,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:12,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:12,650 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-03 17:15:12,650 INFO L205 CegarAbsIntRunner]: [0], [7], [17], [36], [44], [46], [53], [76], [80], [86], [93], [98], [102], [104], [106], [117], [120] [2018-12-03 17:15:12,651 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:12,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:12,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:12,764 INFO L272 AbstractInterpreter]: Visited 17 different actions 198 times. Merged at 14 different actions 113 times. Widened at 10 different actions 51 times. Found 65 fixpoints after 14 different actions. Largest state had 0 variables. [2018-12-03 17:15:12,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:12,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:12,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:12,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:12,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:12,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:12,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:15:12,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:15:13,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:13,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2018-12-03 17:15:13,168 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:13,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:15:13,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:15:13,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:15:13,170 INFO L87 Difference]: Start difference. First operand 377 states and 694 transitions. Second operand 11 states. [2018-12-03 17:15:19,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:19,361 INFO L93 Difference]: Finished difference Result 1093 states and 1964 transitions. [2018-12-03 17:15:19,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:15:19,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-03 17:15:19,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:19,365 INFO L225 Difference]: With dead ends: 1093 [2018-12-03 17:15:19,365 INFO L226 Difference]: Without dead ends: 1089 [2018-12-03 17:15:19,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=417, Invalid=1389, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:15:19,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2018-12-03 17:15:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 353. [2018-12-03 17:15:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-12-03 17:15:20,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 655 transitions. [2018-12-03 17:15:20,467 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 655 transitions. Word has length 23 [2018-12-03 17:15:20,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:20,467 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 655 transitions. [2018-12-03 17:15:20,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:15:20,468 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 655 transitions. [2018-12-03 17:15:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:15:20,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:20,468 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:20,469 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:20,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:20,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2101296367, now seen corresponding path program 1 times [2018-12-03 17:15:20,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:20,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:20,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:20,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:20,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:15:21,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:21,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:21,163 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:15:21,163 INFO L205 CegarAbsIntRunner]: [0], [7], [17], [36], [44], [53], [76], [80], [87], [92], [93], [98], [102], [104], [106], [117], [120] [2018-12-03 17:15:21,164 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:21,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:21,224 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:21,224 INFO L272 AbstractInterpreter]: Visited 17 different actions 129 times. Merged at 16 different actions 70 times. Widened at 9 different actions 18 times. Found 40 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 17:15:21,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:21,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:21,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:21,233 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:21,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:21,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:21,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:15:21,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:15:21,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:21,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2018-12-03 17:15:21,479 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:21,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:15:21,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:15:21,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:15:21,480 INFO L87 Difference]: Start difference. First operand 353 states and 655 transitions. Second operand 11 states. [2018-12-03 17:15:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:27,096 INFO L93 Difference]: Finished difference Result 985 states and 1765 transitions. [2018-12-03 17:15:27,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:15:27,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-12-03 17:15:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:27,096 INFO L225 Difference]: With dead ends: 985 [2018-12-03 17:15:27,096 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:15:27,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=433, Invalid=1127, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:15:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:15:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:15:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:15:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:15:27,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-12-03 17:15:27,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:27,100 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:15:27,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:15:27,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:15:27,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:15:27,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:15:27,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:28,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:31,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:39,172 WARN L180 SmtUtils]: Spent 12.06 s on a formula simplification. DAG size of input: 660 DAG size of output: 604 [2018-12-03 17:15:47,956 WARN L180 SmtUtils]: Spent 8.78 s on a formula simplification. DAG size of input: 617 DAG size of output: 592 [2018-12-03 17:15:47,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:47,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:47,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:47,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:47,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:48,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:48,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:48,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:49,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:50,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:50,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:50,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:50,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:50,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:50,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:51,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:51,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:55,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:56,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:56,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:56,863 WARN L180 SmtUtils]: Spent 8.90 s on a formula simplification. DAG size of input: 844 DAG size of output: 714 [2018-12-03 17:15:57,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:57,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:57,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:57,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:15:57,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:00,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:00,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:00,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:00,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:01,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:01,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:01,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:03,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:03,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:03,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:03,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:03,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:03,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:04,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:04,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:04,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:04,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:06,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:06,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:07,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:07,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:07,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:07,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:08,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:10,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:18,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:20,729 WARN L180 SmtUtils]: Spent 23.86 s on a formula simplification. DAG size of input: 1421 DAG size of output: 1253 [2018-12-03 17:16:22,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:23,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:24,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:24,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:25,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:25,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:25,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:26,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:30,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:32,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:35,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:38,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:42,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:48,655 WARN L180 SmtUtils]: Spent 27.92 s on a formula simplification. DAG size of input: 1215 DAG size of output: 1118 [2018-12-03 17:16:49,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:50,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:50,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:53,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:53,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:54,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:57,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:57,674 WARN L180 SmtUtils]: Spent 9.01 s on a formula simplification. DAG size of input: 783 DAG size of output: 668 [2018-12-03 17:16:57,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:57,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:58,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:16:58,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:01,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:02,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:03,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:05,450 WARN L180 SmtUtils]: Spent 7.77 s on a formula simplification. DAG size of input: 604 DAG size of output: 565 [2018-12-03 17:17:05,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:06,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:06,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:06,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:06,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:06,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:07,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:13,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:13,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:15,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:26,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:30,156 WARN L180 SmtUtils]: Spent 24.70 s on a formula simplification. DAG size of input: 1274 DAG size of output: 1157 [2018-12-03 17:17:30,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:30,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:30,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:30,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:30,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:30,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:31,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:31,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:31,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:31,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:31,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:32,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:32,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:32,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:32,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:32,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:32,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:32,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:33,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:33,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:33,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:33,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:34,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:34,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:35,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:35,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:35,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:36,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:36,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:36,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:36,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:36,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:38,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:38,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:38,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:38,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:38,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:38,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:38,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:38,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:38,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:39,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:40,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:40,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:40,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:41,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:41,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:41,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:42,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:42,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:42,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:42,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:42,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:43,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:43,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:44,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:44,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:44,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:44,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:46,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:46,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:46,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:46,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:47,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:49,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:51,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:51,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:51,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:53,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:53,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:55,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:56,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:56,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:56,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:56,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:56,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:56,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:56,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:59,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:59,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:17:59,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:01,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:02,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:15,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:22,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:25,324 WARN L180 SmtUtils]: Spent 55.16 s on a formula simplification. DAG size of input: 2424 DAG size of output: 2077 [2018-12-03 17:18:25,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:25,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:25,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:25,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:25,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:25,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:25,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:26,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:26,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:26,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:26,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:26,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:33,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:33,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:33,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:36,158 WARN L180 SmtUtils]: Spent 10.83 s on a formula simplification. DAG size of input: 823 DAG size of output: 727 [2018-12-03 17:18:36,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:36,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:38,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:39,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:40,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:40,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:40,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:40,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:42,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:42,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:43,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:43,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:43,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:45,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:46,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:57,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:57,405 WARN L180 SmtUtils]: Spent 21.24 s on a formula simplification. DAG size of input: 1322 DAG size of output: 1205 [2018-12-03 17:18:57,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:57,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:57,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:57,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:57,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:57,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:57,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:57,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:57,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:58,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:58,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:58,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:58,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:58,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:18:58,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:00,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:00,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:00,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:01,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:01,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:01,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:01,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:02,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:02,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:03,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:03,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:03,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:04,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:04,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:04,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:04,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:04,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:04,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:07,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:07,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:07,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:08,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:09,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:09,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:10,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:10,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:11,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:12,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:13,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:13,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:14,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:16,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:17,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:18,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:19,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:19,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:19,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:19,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:19,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:21,583 WARN L180 SmtUtils]: Spent 24.17 s on a formula simplification. DAG size of input: 1375 DAG size of output: 1146 [2018-12-03 17:19:21,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:21,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:21,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:21,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:21,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:21,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:21,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:22,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:22,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:22,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:22,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:22,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:22,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:23,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:23,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:23,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:23,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:23,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:23,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:23,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:23,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:23,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:23,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:23,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:24,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:24,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:25,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:26,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:26,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:27,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:28,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:28,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:28,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:28,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:28,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:28,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:31,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:32,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:33,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:33,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:33,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:33,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:33,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:33,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:34,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:38,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:39,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:39,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:40,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:41,067 WARN L180 SmtUtils]: Spent 19.48 s on a formula simplification. DAG size of input: 1374 DAG size of output: 1174 [2018-12-03 17:19:41,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:41,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:41,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:41,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:41,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:41,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:41,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:43,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:43,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:47,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:48,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:48,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:49,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:50,715 WARN L180 SmtUtils]: Spent 9.64 s on a formula simplification. DAG size of input: 780 DAG size of output: 681 [2018-12-03 17:19:50,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:50,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:50,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:51,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:19:56,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:20:00,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:20:03,301 WARN L180 SmtUtils]: Spent 12.58 s on a formula simplification. DAG size of input: 741 DAG size of output: 691 [2018-12-03 17:20:15,309 WARN L180 SmtUtils]: Spent 12.00 s on a formula simplification. DAG size of input: 597 DAG size of output: 58 [2018-12-03 17:20:30,667 WARN L180 SmtUtils]: Spent 15.35 s on a formula simplification. DAG size of input: 592 DAG size of output: 71 [2018-12-03 17:20:52,511 WARN L180 SmtUtils]: Spent 21.84 s on a formula simplification. DAG size of input: 707 DAG size of output: 61 [2018-12-03 17:21:29,846 WARN L180 SmtUtils]: Spent 37.32 s on a formula simplification. DAG size of input: 1224 DAG size of output: 121 [2018-12-03 17:22:15,018 WARN L180 SmtUtils]: Spent 45.16 s on a formula simplification. DAG size of input: 1100 DAG size of output: 114 [2018-12-03 17:22:33,520 WARN L180 SmtUtils]: Spent 18.49 s on a formula simplification. DAG size of input: 664 DAG size of output: 77 [2018-12-03 17:22:47,696 WARN L180 SmtUtils]: Spent 14.17 s on a formula simplification. DAG size of input: 559 DAG size of output: 85 [2018-12-03 17:23:30,762 WARN L180 SmtUtils]: Spent 43.05 s on a formula simplification. DAG size of input: 1137 DAG size of output: 121 [2018-12-03 17:25:27,848 WARN L180 SmtUtils]: Spent 1.95 m on a formula simplification. DAG size of input: 2010 DAG size of output: 137 [2018-12-03 17:25:41,384 WARN L180 SmtUtils]: Spent 13.53 s on a formula simplification. DAG size of input: 714 DAG size of output: 60 [2018-12-03 17:26:26,463 WARN L180 SmtUtils]: Spent 45.07 s on a formula simplification. DAG size of input: 1193 DAG size of output: 125