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_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:07:52,432 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:07:52,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:07:52,450 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:07:52,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:07:52,452 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:07:52,453 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:07:52,455 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:07:52,457 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:07:52,457 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:07:52,458 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:07:52,459 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:07:52,460 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:07:52,461 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:07:52,462 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:07:52,463 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:07:52,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:07:52,467 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:07:52,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:07:52,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:07:52,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:07:52,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:07:52,481 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:07:52,481 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:07:52,481 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:07:52,482 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:07:52,483 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:07:52,486 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:07:52,487 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:07:52,488 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:07:52,488 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:07:52,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:07:52,489 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:07:52,489 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:07:52,491 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:07:52,492 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:07:52,493 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:07:52,512 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:07:52,512 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:07:52,513 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:07:52,513 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:07:52,513 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:07:52,513 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:07:52,514 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:07:52,515 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:07:52,515 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:07:52,516 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:07:52,516 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:07:52,516 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:07:52,516 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:07:52,516 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:07:52,517 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:07:52,517 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:07:52,518 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:07:52,518 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:07:52,518 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:07:52,518 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:07:52,518 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:07:52,519 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:07:52,519 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:07:52,519 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:07:52,519 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:07:52,519 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:07:52,520 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:07:52,521 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:07:52,522 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:07:52,522 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:07:52,522 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:07:52,522 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:07:52,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:07:52,523 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:07:52,523 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:07:52,523 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:07:52,523 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:07:52,523 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:07:52,524 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:07:52,524 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:07:52,524 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:07:52,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:07:52,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:07:52,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:07:52,579 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:07:52,579 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:07:52,580 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl [2018-12-03 15:07:52,580 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-12-03 15:07:52,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:07:52,639 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:07:52,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:52,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:07:52,640 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:07:52,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:52" (1/1) ... [2018-12-03 15:07:52,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:52" (1/1) ... [2018-12-03 15:07:52,677 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:07:52,678 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:07:52,678 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:07:52,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:52,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:07:52,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:07:52,681 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:07:52,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:52" (1/1) ... [2018-12-03 15:07:52,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:52" (1/1) ... [2018-12-03 15:07:52,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:52" (1/1) ... [2018-12-03 15:07:52,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:52" (1/1) ... [2018-12-03 15:07:52,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:52" (1/1) ... [2018-12-03 15:07:52,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:52" (1/1) ... [2018-12-03 15:07:52,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:52" (1/1) ... [2018-12-03 15:07:52,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:07:52,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:07:52,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:07:52,750 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:07:52,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:52" (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 15:07:52,823 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 15:07:52,823 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 15:07:52,823 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 15:07:53,691 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:07:53,691 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:07:53,692 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:07:53 BoogieIcfgContainer [2018-12-03 15:07:53,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:07:53,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:07:53,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:07:53,696 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:07:53,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:52" (1/2) ... [2018-12-03 15:07:53,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edc16f8 and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:07:53, skipping insertion in model container [2018-12-03 15:07:53,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:07:53" (2/2) ... [2018-12-03 15:07:53,700 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-12-03 15:07:53,710 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:07:53,718 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-12-03 15:07:53,736 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-12-03 15:07:53,771 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:07:53,772 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:07:53,772 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:07:53,772 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:07:53,772 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:07:53,772 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:07:53,772 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:07:53,773 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:07:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-12-03 15:07:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:07:53,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:53,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:53,802 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:53,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:53,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-12-03 15:07:53,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:53,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:53,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:53,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:53,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:54,120 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 15:07:54,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:54,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:07:54,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:54,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:07:54,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:07:54,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:07:54,141 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-12-03 15:07:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:55,951 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-12-03 15:07:55,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:07:55,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 15:07:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:55,973 INFO L225 Difference]: With dead ends: 163 [2018-12-03 15:07:55,973 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 15:07:55,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:07:55,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 15:07:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-12-03 15:07:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 15:07:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-12-03 15:07:56,040 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-12-03 15:07:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:56,040 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-12-03 15:07:56,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:07:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-12-03 15:07:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:07:56,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:56,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:56,043 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:56,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:56,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-12-03 15:07:56,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:56,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:56,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:56,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:56,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:56,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:56,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:07:56,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:56,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:07:56,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:07:56,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:07:56,168 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-12-03 15:07:57,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:57,095 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-12-03 15:07:57,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:07:57,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 15:07:57,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:57,100 INFO L225 Difference]: With dead ends: 188 [2018-12-03 15:07:57,100 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 15:07:57,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:07:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 15:07:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-12-03 15:07:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 15:07:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-12-03 15:07:57,127 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-12-03 15:07:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:57,128 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-12-03 15:07:57,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:07:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-12-03 15:07:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:07:57,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:57,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:57,132 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:57,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:57,133 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-12-03 15:07:57,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:57,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:57,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:57,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:57,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:57,239 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 15:07:57,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:57,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 15:07:57,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:57,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:07:57,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:07:57,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:07:57,241 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-12-03 15:07:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:58,611 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-12-03 15:07:58,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:07:58,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 15:07:58,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:58,622 INFO L225 Difference]: With dead ends: 283 [2018-12-03 15:07:58,622 INFO L226 Difference]: Without dead ends: 278 [2018-12-03 15:07:58,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:07:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-03 15:07:58,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-12-03 15:07:58,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 15:07:58,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-12-03 15:07:58,663 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-12-03 15:07:58,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:58,663 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-12-03 15:07:58,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:07:58,664 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-12-03 15:07:58,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:07:58,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:58,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:58,666 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:58,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:58,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-12-03 15:07:58,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:58,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:58,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:58,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:58,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:58,773 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 15:07:58,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:58,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 15:07:58,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:58,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:07:58,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:07:58,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:07:58,775 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-12-03 15:08:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:00,404 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-12-03 15:08:00,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:08:00,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 15:08:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:00,409 INFO L225 Difference]: With dead ends: 387 [2018-12-03 15:08:00,409 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 15:08:00,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:08:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 15:08:00,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-12-03 15:08:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 15:08:00,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-12-03 15:08:00,452 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-12-03 15:08:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:00,452 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-12-03 15:08:00,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:08:00,452 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-12-03 15:08:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:00,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:00,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:00,455 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:00,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:00,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-12-03 15:08:00,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:00,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:00,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:00,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:00,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:00,819 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 15:08:00,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:00,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:00,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:00,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:00,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:00,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:00,821 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-12-03 15:08:02,104 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:08:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:04,934 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-12-03 15:08:04,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:08:04,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:04,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:04,941 INFO L225 Difference]: With dead ends: 725 [2018-12-03 15:08:04,941 INFO L226 Difference]: Without dead ends: 717 [2018-12-03 15:08:04,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:08:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-12-03 15:08:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-12-03 15:08:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-03 15:08:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-12-03 15:08:05,007 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-12-03 15:08:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:05,007 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-12-03 15:08:05,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-12-03 15:08:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:05,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:05,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:05,010 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:05,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:05,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-12-03 15:08:05,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:05,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:05,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:05,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:05,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:05,157 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 15:08:05,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:05,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:05,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:05,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:05,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:05,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:05,160 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-12-03 15:08:07,850 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 15:08:09,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:09,904 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-12-03 15:08:09,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:08:09,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:09,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:09,912 INFO L225 Difference]: With dead ends: 1008 [2018-12-03 15:08:09,912 INFO L226 Difference]: Without dead ends: 1000 [2018-12-03 15:08:09,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:08:09,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-12-03 15:08:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-12-03 15:08:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-03 15:08:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-12-03 15:08:09,986 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-12-03 15:08:09,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:09,986 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-12-03 15:08:09,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-12-03 15:08:09,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:09,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:09,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:09,989 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:09,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:09,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-12-03 15:08:09,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:09,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:09,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:09,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:09,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:10,124 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 15:08:10,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:10,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:10,125 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:10,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:10,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:10,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:10,126 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-12-03 15:08:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:12,940 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-12-03 15:08:12,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:08:12,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:12,948 INFO L225 Difference]: With dead ends: 924 [2018-12-03 15:08:12,948 INFO L226 Difference]: Without dead ends: 916 [2018-12-03 15:08:12,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:08:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-12-03 15:08:13,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-12-03 15:08:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-12-03 15:08:13,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-12-03 15:08:13,032 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-12-03 15:08:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:13,032 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-12-03 15:08:13,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-12-03 15:08:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:13,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:13,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:13,034 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:13,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:13,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-12-03 15:08:13,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:13,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:13,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:13,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:13,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:13,116 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 15:08:13,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:13,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:13,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:13,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:13,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:13,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:13,119 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-12-03 15:08:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:14,962 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-12-03 15:08:14,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:08:14,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:14,968 INFO L225 Difference]: With dead ends: 791 [2018-12-03 15:08:14,969 INFO L226 Difference]: Without dead ends: 783 [2018-12-03 15:08:14,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:08:14,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-03 15:08:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-12-03 15:08:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-12-03 15:08:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-12-03 15:08:15,067 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-12-03 15:08:15,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:15,067 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-12-03 15:08:15,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-12-03 15:08:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:15,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:15,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:15,069 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:15,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:15,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-12-03 15:08:15,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:15,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:15,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:15,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:15,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:15,161 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 15:08:15,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:15,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:15,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:15,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:15,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:15,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:15,163 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-12-03 15:08:17,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:17,462 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-12-03 15:08:17,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:08:17,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:17,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:17,469 INFO L225 Difference]: With dead ends: 1040 [2018-12-03 15:08:17,470 INFO L226 Difference]: Without dead ends: 1032 [2018-12-03 15:08:17,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:08:17,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-12-03 15:08:17,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-12-03 15:08:17,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-12-03 15:08:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-12-03 15:08:17,594 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-12-03 15:08:17,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:17,594 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-12-03 15:08:17,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:17,595 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-12-03 15:08:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:17,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:17,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:17,596 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:17,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:17,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-12-03 15:08:17,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:17,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:17,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:17,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:17,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:17,684 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 15:08:17,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:17,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:17,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:17,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:17,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:17,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:17,686 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-12-03 15:08:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:20,354 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-12-03 15:08:20,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:08:20,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:20,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:20,363 INFO L225 Difference]: With dead ends: 1166 [2018-12-03 15:08:20,363 INFO L226 Difference]: Without dead ends: 1158 [2018-12-03 15:08:20,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:08:20,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-12-03 15:08:20,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-12-03 15:08:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-12-03 15:08:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-12-03 15:08:20,505 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-12-03 15:08:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:20,505 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-12-03 15:08:20,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-12-03 15:08:20,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:20,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:20,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:20,507 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:20,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:20,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-12-03 15:08:20,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:20,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:20,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:20,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:20,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:20,685 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 15:08:20,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:20,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:20,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:20,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:20,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:20,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:20,687 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-12-03 15:08:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:23,322 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-12-03 15:08:23,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:08:23,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:23,328 INFO L225 Difference]: With dead ends: 1127 [2018-12-03 15:08:23,329 INFO L226 Difference]: Without dead ends: 1119 [2018-12-03 15:08:23,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:08:23,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-12-03 15:08:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-12-03 15:08:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-12-03 15:08:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-12-03 15:08:23,523 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-12-03 15:08:23,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:23,524 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-12-03 15:08:23,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-12-03 15:08:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:23,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:23,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:23,525 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:23,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:23,526 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-12-03 15:08:23,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:23,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:23,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:23,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:23,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:23,642 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 15:08:23,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:23,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:23,643 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:23,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:23,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:23,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:23,644 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-12-03 15:08:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:26,093 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-12-03 15:08:26,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:08:26,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:26,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:26,100 INFO L225 Difference]: With dead ends: 975 [2018-12-03 15:08:26,101 INFO L226 Difference]: Without dead ends: 967 [2018-12-03 15:08:26,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:08:26,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-12-03 15:08:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-12-03 15:08:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-03 15:08:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-12-03 15:08:26,263 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-12-03 15:08:26,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:26,265 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-12-03 15:08:26,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-12-03 15:08:26,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:26,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:26,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:26,268 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:26,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:26,268 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-12-03 15:08:26,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:26,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:26,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:26,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:26,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:26,355 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 15:08:26,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:26,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:26,356 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:26,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:26,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:26,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:26,357 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-12-03 15:08:28,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:28,890 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-12-03 15:08:28,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:08:28,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:28,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:28,895 INFO L225 Difference]: With dead ends: 1011 [2018-12-03 15:08:28,896 INFO L226 Difference]: Without dead ends: 1003 [2018-12-03 15:08:28,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:08:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-12-03 15:08:29,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-12-03 15:08:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-12-03 15:08:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-12-03 15:08:29,123 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-12-03 15:08:29,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:29,123 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-12-03 15:08:29,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-12-03 15:08:29,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:29,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:29,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:29,124 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:29,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:29,125 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-12-03 15:08:29,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:29,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:29,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:29,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:29,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:29,200 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 15:08:29,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:29,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:29,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:29,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:29,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:29,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:29,201 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-12-03 15:08:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:31,378 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-12-03 15:08:31,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:08:31,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:31,384 INFO L225 Difference]: With dead ends: 859 [2018-12-03 15:08:31,385 INFO L226 Difference]: Without dead ends: 851 [2018-12-03 15:08:31,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:08:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-12-03 15:08:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-12-03 15:08:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-12-03 15:08:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-12-03 15:08:31,574 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-12-03 15:08:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:31,575 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-12-03 15:08:31,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-12-03 15:08:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:31,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:31,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:31,576 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:31,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:31,576 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-12-03 15:08:31,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:31,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:31,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:31,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:31,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:31,657 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 15:08:31,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:31,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:31,658 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:31,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:31,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:31,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:31,659 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-12-03 15:08:33,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:33,960 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-12-03 15:08:33,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:08:33,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:08:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:33,965 INFO L225 Difference]: With dead ends: 962 [2018-12-03 15:08:33,965 INFO L226 Difference]: Without dead ends: 954 [2018-12-03 15:08:33,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:08:33,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-12-03 15:08:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-12-03 15:08:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-12-03 15:08:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-12-03 15:08:34,245 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-12-03 15:08:34,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:34,246 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-12-03 15:08:34,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-12-03 15:08:34,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:34,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:34,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:34,247 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:34,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:34,247 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-12-03 15:08:34,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:34,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:34,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:34,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:34,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:34,332 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 15:08:34,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:34,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:34,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:34,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:34,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:34,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:34,333 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-12-03 15:08:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:36,942 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-12-03 15:08:36,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:08:36,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:08:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:36,949 INFO L225 Difference]: With dead ends: 1064 [2018-12-03 15:08:36,949 INFO L226 Difference]: Without dead ends: 1056 [2018-12-03 15:08:36,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:08:36,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-12-03 15:08:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-12-03 15:08:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-12-03 15:08:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-12-03 15:08:37,274 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-12-03 15:08:37,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:37,275 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-12-03 15:08:37,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:37,275 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-12-03 15:08:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:37,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:37,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:37,276 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:37,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:37,276 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-12-03 15:08:37,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:37,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:37,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:37,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:37,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:37,352 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 15:08:37,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:37,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:37,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:37,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:37,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:37,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:37,354 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-12-03 15:08:40,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:40,549 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-12-03 15:08:40,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:08:40,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:08:40,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:40,555 INFO L225 Difference]: With dead ends: 1241 [2018-12-03 15:08:40,555 INFO L226 Difference]: Without dead ends: 1233 [2018-12-03 15:08:40,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:08:40,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-12-03 15:08:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-12-03 15:08:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-12-03 15:08:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-12-03 15:08:40,920 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-12-03 15:08:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:40,920 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-12-03 15:08:40,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:40,920 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-12-03 15:08:40,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:40,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:40,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:40,922 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:40,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:40,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-12-03 15:08:40,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:40,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:40,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:40,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:40,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:41,022 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 15:08:41,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:41,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:41,023 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:41,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:41,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:41,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:41,023 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-12-03 15:08:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:43,448 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-12-03 15:08:43,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:08:43,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:08:43,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:43,454 INFO L225 Difference]: With dead ends: 1139 [2018-12-03 15:08:43,454 INFO L226 Difference]: Without dead ends: 1131 [2018-12-03 15:08:43,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:08:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-12-03 15:08:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-12-03 15:08:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-12-03 15:08:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-12-03 15:08:43,758 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-12-03 15:08:43,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:43,759 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-12-03 15:08:43,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:43,759 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-12-03 15:08:43,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:43,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:43,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:43,760 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:43,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:43,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-12-03 15:08:43,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:43,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:43,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:43,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:43,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:43,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:43,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:43,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:43,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:43,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:43,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:43,836 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-12-03 15:08:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:46,952 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-12-03 15:08:46,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:08:46,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:08:46,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:46,958 INFO L225 Difference]: With dead ends: 1325 [2018-12-03 15:08:46,959 INFO L226 Difference]: Without dead ends: 1317 [2018-12-03 15:08:46,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:08:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-12-03 15:08:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-12-03 15:08:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-12-03 15:08:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-12-03 15:08:47,277 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-12-03 15:08:47,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:47,277 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-12-03 15:08:47,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-12-03 15:08:47,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:47,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:47,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:47,278 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:47,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:47,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-12-03 15:08:47,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:47,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:47,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:47,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:47,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:47,354 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 15:08:47,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:47,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:47,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:47,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:47,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:47,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:47,356 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-12-03 15:08:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:50,717 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-12-03 15:08:50,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:08:50,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:08:50,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:50,723 INFO L225 Difference]: With dead ends: 1334 [2018-12-03 15:08:50,723 INFO L226 Difference]: Without dead ends: 1326 [2018-12-03 15:08:50,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:08:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-12-03 15:08:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-12-03 15:08:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-12-03 15:08:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-12-03 15:08:51,088 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-12-03 15:08:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:51,088 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-12-03 15:08:51,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-12-03 15:08:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:51,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:51,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:51,089 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:51,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:51,089 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-12-03 15:08:51,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:51,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:51,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:51,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:51,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:51,165 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 15:08:51,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:51,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:51,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:51,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:51,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:51,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:51,167 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-12-03 15:08:53,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:53,311 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-12-03 15:08:53,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:08:53,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:08:53,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:53,316 INFO L225 Difference]: With dead ends: 919 [2018-12-03 15:08:53,317 INFO L226 Difference]: Without dead ends: 911 [2018-12-03 15:08:53,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:08:53,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-12-03 15:08:53,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-12-03 15:08:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-12-03 15:08:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-12-03 15:08:53,689 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-12-03 15:08:53,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:53,689 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-12-03 15:08:53,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-12-03 15:08:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:53,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:53,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:53,690 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:53,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-12-03 15:08:53,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:53,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:53,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:53,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:53,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:53,775 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 15:08:53,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:53,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:53,776 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:53,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:53,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:53,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:53,777 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-12-03 15:08:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:56,412 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-12-03 15:08:56,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:08:56,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:08:56,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:56,420 INFO L225 Difference]: With dead ends: 1095 [2018-12-03 15:08:56,420 INFO L226 Difference]: Without dead ends: 1087 [2018-12-03 15:08:56,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:08:56,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-12-03 15:08:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-12-03 15:08:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-12-03 15:08:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-12-03 15:08:56,769 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-12-03 15:08:56,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:56,769 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-12-03 15:08:56,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:56,769 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-12-03 15:08:56,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:56,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:56,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:56,771 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:56,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:56,771 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-12-03 15:08:56,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:56,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:56,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:56,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:56,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:56,880 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 15:08:56,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:56,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:56,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:56,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:56,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:56,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:56,882 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-12-03 15:09:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:00,706 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-12-03 15:09:00,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:09:00,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:09:00,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:00,710 INFO L225 Difference]: With dead ends: 1304 [2018-12-03 15:09:00,710 INFO L226 Difference]: Without dead ends: 1296 [2018-12-03 15:09:00,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:09:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-12-03 15:09:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-12-03 15:09:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-03 15:09:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-12-03 15:09:01,107 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-12-03 15:09:01,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:01,107 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-12-03 15:09:01,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:09:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-12-03 15:09:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:09:01,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:01,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:01,109 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:01,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:01,109 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-12-03 15:09:01,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:01,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:01,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:01,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:01,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:01,183 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 15:09:01,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:09:01,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:09:01,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:01,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:09:01,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:09:01,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:09:01,184 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-12-03 15:09:04,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:04,677 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-12-03 15:09:04,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:09:04,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:09:04,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:04,680 INFO L225 Difference]: With dead ends: 1192 [2018-12-03 15:09:04,681 INFO L226 Difference]: Without dead ends: 1184 [2018-12-03 15:09:04,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:09:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-12-03 15:09:05,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-12-03 15:09:05,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-12-03 15:09:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-12-03 15:09:05,171 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-12-03 15:09:05,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:05,171 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-12-03 15:09:05,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:09:05,171 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-12-03 15:09:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:09:05,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:05,172 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:05,172 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:05,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:05,173 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-12-03 15:09:05,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:05,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:05,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:05,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:05,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:05,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:09:05,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:09:05,224 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:05,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:09:05,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:09:05,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:09:05,224 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-12-03 15:09:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:06,046 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-12-03 15:09:06,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:09:06,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 15:09:06,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:06,048 INFO L225 Difference]: With dead ends: 1139 [2018-12-03 15:09:06,048 INFO L226 Difference]: Without dead ends: 625 [2018-12-03 15:09:06,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:09:06,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-12-03 15:09:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-12-03 15:09:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-12-03 15:09:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-12-03 15:09:06,520 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-12-03 15:09:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:06,521 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-12-03 15:09:06,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:09:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-12-03 15:09:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:09:06,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:06,522 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:06,522 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:06,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:06,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-12-03 15:09:06,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:06,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:06,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:06,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:06,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:06,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:06,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:06,673 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 15:09:06,675 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [92], [132], [251], [252], [337], [345], [351] [2018-12-03 15:09:06,715 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:06,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:06,983 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:06,985 INFO L272 AbstractInterpreter]: Visited 11 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:09:07,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:07,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:07,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:07,032 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 15:09:07,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:07,047 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:07,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:07,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:08,084 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 15:09:08,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:08,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2018-12-03 15:09:08,106 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:08,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:09:08,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:09:08,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:09:08,108 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-12-03 15:09:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:11,927 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-12-03 15:09:11,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:09:11,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-12-03 15:09:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:11,930 INFO L225 Difference]: With dead ends: 794 [2018-12-03 15:09:11,930 INFO L226 Difference]: Without dead ends: 789 [2018-12-03 15:09:11,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:09:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-12-03 15:09:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-12-03 15:09:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-12-03 15:09:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-12-03 15:09:12,766 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-12-03 15:09:12,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:12,766 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-12-03 15:09:12,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:09:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-12-03 15:09:12,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:09:12,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:12,767 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:12,768 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:12,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:12,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-12-03 15:09:12,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:12,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:12,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:12,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:12,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:12,837 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 15:09:12,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:09:12,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:09:12,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:12,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:09:12,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:09:12,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:09:12,838 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-12-03 15:09:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:14,427 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-12-03 15:09:14,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:09:14,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 15:09:14,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:14,429 INFO L225 Difference]: With dead ends: 1317 [2018-12-03 15:09:14,429 INFO L226 Difference]: Without dead ends: 729 [2018-12-03 15:09:14,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:09:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-12-03 15:09:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-12-03 15:09:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-12-03 15:09:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-12-03 15:09:15,164 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-12-03 15:09:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:15,165 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-12-03 15:09:15,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:09:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-12-03 15:09:15,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:15,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:15,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:15,167 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:15,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:15,167 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-12-03 15:09:15,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:15,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:15,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:15,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:15,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:15,349 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 15:09:15,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:09:15,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:09:15,349 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:15,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:09:15,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:09:15,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:09:15,350 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-12-03 15:09:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:18,705 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-12-03 15:09:18,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:09:18,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:09:18,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:18,709 INFO L225 Difference]: With dead ends: 1435 [2018-12-03 15:09:18,710 INFO L226 Difference]: Without dead ends: 1427 [2018-12-03 15:09:18,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:09:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-12-03 15:09:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-12-03 15:09:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-12-03 15:09:19,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-12-03 15:09:19,474 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-12-03 15:09:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:19,474 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-12-03 15:09:19,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:09:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-12-03 15:09:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:19,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:19,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:19,476 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:19,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:19,476 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-12-03 15:09:19,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:19,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:19,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:19,660 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 15:09:19,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:09:19,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:09:19,660 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:19,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:09:19,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:09:19,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:09:19,661 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-12-03 15:09:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:23,408 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-12-03 15:09:23,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:09:23,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:09:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:23,413 INFO L225 Difference]: With dead ends: 1599 [2018-12-03 15:09:23,413 INFO L226 Difference]: Without dead ends: 1591 [2018-12-03 15:09:23,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:09:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-12-03 15:09:24,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-12-03 15:09:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-12-03 15:09:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-12-03 15:09:24,307 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-12-03 15:09:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:24,307 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-12-03 15:09:24,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:09:24,308 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-12-03 15:09:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:24,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:24,308 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:24,308 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:24,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:24,309 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-12-03 15:09:24,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:24,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:24,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:24,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:24,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:24,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:09:24,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:09:24,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:24,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:09:24,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:09:24,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:09:24,382 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-12-03 15:09:27,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:27,524 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-12-03 15:09:27,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:09:27,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:09:27,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:27,528 INFO L225 Difference]: With dead ends: 1411 [2018-12-03 15:09:27,528 INFO L226 Difference]: Without dead ends: 1403 [2018-12-03 15:09:27,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:09:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-12-03 15:09:28,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-12-03 15:09:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-03 15:09:28,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-12-03 15:09:28,415 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-12-03 15:09:28,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:28,415 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-12-03 15:09:28,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:09:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-12-03 15:09:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:28,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:28,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:28,416 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:28,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:28,417 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-12-03 15:09:28,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:28,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:28,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:28,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:28,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:28,511 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 15:09:28,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:09:28,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:09:28,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:28,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:09:28,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:09:28,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:09:28,512 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-12-03 15:09:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:32,011 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-12-03 15:09:32,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:09:32,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:09:32,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:32,014 INFO L225 Difference]: With dead ends: 1490 [2018-12-03 15:09:32,014 INFO L226 Difference]: Without dead ends: 1482 [2018-12-03 15:09:32,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:09:32,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-12-03 15:09:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-12-03 15:09:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-12-03 15:09:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-12-03 15:09:32,917 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-12-03 15:09:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:32,918 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-12-03 15:09:32,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:09:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-12-03 15:09:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:32,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:32,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:32,919 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:32,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:32,919 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-12-03 15:09:32,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:32,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:32,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:32,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:32,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:33,001 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 15:09:33,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:09:33,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:09:33,002 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:33,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:09:33,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:09:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:09:33,003 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-12-03 15:09:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:36,339 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-12-03 15:09:36,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:09:36,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:09:36,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:36,341 INFO L225 Difference]: With dead ends: 1427 [2018-12-03 15:09:36,341 INFO L226 Difference]: Without dead ends: 1419 [2018-12-03 15:09:36,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:09:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-12-03 15:09:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-12-03 15:09:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-12-03 15:09:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-12-03 15:09:37,219 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-12-03 15:09:37,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:37,219 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-12-03 15:09:37,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:09:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-12-03 15:09:37,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:37,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:37,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:37,220 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:37,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:37,221 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-12-03 15:09:37,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:37,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:37,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:37,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:37,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:37,323 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 15:09:37,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:09:37,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:09:37,324 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:37,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:09:37,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:09:37,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:09:37,325 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-12-03 15:09:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:40,730 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-12-03 15:09:40,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:09:40,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:09:40,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:40,732 INFO L225 Difference]: With dead ends: 1306 [2018-12-03 15:09:40,732 INFO L226 Difference]: Without dead ends: 1298 [2018-12-03 15:09:40,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:09:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-12-03 15:09:41,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-12-03 15:09:41,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-12-03 15:09:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-12-03 15:09:41,703 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-12-03 15:09:41,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:41,703 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-12-03 15:09:41,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:09:41,703 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-12-03 15:09:41,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:41,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:41,704 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:41,704 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:41,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:41,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-12-03 15:09:41,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:41,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:41,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:41,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:41,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:41,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:41,779 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:41,780 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:09:41,780 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [113], [120], [122], [126], [203], [236], [245], [254], [260], [274], [349] [2018-12-03 15:09:41,781 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:41,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:41,797 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:41,797 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:09:41,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:41,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:41,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:41,799 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 15:09:41,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:41,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:41,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:41,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:41,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:41,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:09:41,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:41,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:09:41,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:09:41,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:09:41,843 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-12-03 15:09:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:44,772 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-12-03 15:09:44,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:09:44,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:09:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:44,774 INFO L225 Difference]: With dead ends: 1285 [2018-12-03 15:09:44,774 INFO L226 Difference]: Without dead ends: 1277 [2018-12-03 15:09:44,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:09:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-12-03 15:09:45,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-12-03 15:09:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-12-03 15:09:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-12-03 15:09:45,926 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-12-03 15:09:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:45,926 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-12-03 15:09:45,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:09:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-12-03 15:09:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:45,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:45,927 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:45,927 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:45,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-12-03 15:09:45,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:45,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:45,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:45,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:45,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:46,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:46,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:46,050 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:09:46,051 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [92], [113], [115], [120], [126], [203], [236], [245], [254], [260], [274], [349] [2018-12-03 15:09:46,052 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:46,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:46,069 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:46,069 INFO L272 AbstractInterpreter]: Visited 15 different actions 19 times. Merged at 3 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:09:46,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:46,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:46,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:46,095 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 15:09:46,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:46,107 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:46,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:46,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:46,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:46,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:09:46,139 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:46,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:09:46,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:09:46,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:09:46,140 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-12-03 15:09:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:49,864 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-12-03 15:09:49,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:09:49,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:09:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:49,867 INFO L225 Difference]: With dead ends: 1518 [2018-12-03 15:09:49,867 INFO L226 Difference]: Without dead ends: 1510 [2018-12-03 15:09:49,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:09:49,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-12-03 15:09:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-12-03 15:09:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-12-03 15:09:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-12-03 15:09:50,871 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-12-03 15:09:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:50,871 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-12-03 15:09:50,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:09:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-12-03 15:09:50,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:50,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:50,872 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:50,872 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:50,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:50,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-12-03 15:09:50,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:50,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:50,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:50,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:50,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:50,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:50,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:50,939 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:09:50,940 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [98], [113], [115], [120], [126], [203], [236], [245], [260], [274], [349] [2018-12-03 15:09:50,941 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:50,941 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:50,957 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:50,957 INFO L272 AbstractInterpreter]: Visited 15 different actions 20 times. Merged at 4 different actions 4 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:09:50,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:50,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:50,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:50,963 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 15:09:50,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:50,972 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:50,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:50,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:51,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:51,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:09:51,019 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:51,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:09:51,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:09:51,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:09:51,020 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-12-03 15:09:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:54,783 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-12-03 15:09:54,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:09:54,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:09:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:54,786 INFO L225 Difference]: With dead ends: 1448 [2018-12-03 15:09:54,786 INFO L226 Difference]: Without dead ends: 1440 [2018-12-03 15:09:54,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:09:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-12-03 15:09:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-12-03 15:09:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-12-03 15:09:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-12-03 15:09:55,758 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-12-03 15:09:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:55,759 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-12-03 15:09:55,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:09:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-12-03 15:09:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:55,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:55,760 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:55,760 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:55,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:55,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-12-03 15:09:55,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:55,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:55,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:55,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:55,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:55,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:55,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:55,826 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:09:55,826 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [102], [113], [115], [120], [126], [183], [203], [229], [260], [274], [349] [2018-12-03 15:09:55,828 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:55,828 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:55,846 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:55,846 INFO L272 AbstractInterpreter]: Visited 15 different actions 22 times. Merged at 6 different actions 6 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:09:55,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:55,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:55,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:55,862 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 15:09:55,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:55,870 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:55,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:55,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:55,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:55,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:09:55,903 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:55,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:09:55,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:09:55,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:09:55,904 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-12-03 15:09:58,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:58,912 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-12-03 15:09:58,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:09:58,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:09:58,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:58,914 INFO L225 Difference]: With dead ends: 1254 [2018-12-03 15:09:58,914 INFO L226 Difference]: Without dead ends: 1246 [2018-12-03 15:09:58,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:09:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-12-03 15:09:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-12-03 15:09:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-12-03 15:09:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-12-03 15:09:59,940 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-12-03 15:09:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:59,940 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-12-03 15:09:59,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:09:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-12-03 15:09:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:59,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:59,941 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:59,942 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:59,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:59,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-12-03 15:09:59,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:59,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:59,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:59,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:59,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:00,094 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 15:10:00,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:00,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:00,094 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:10:00,094 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [92], [132], [203], [236], [245], [252], [254], [337], [345], [351] [2018-12-03 15:10:00,095 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:10:00,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:10:00,106 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:10:00,106 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:10:00,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:00,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:10:00,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:00,118 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 15:10:00,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:00,128 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:10:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:00,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:00,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:00,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:00,580 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 15:10:00,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:00,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2018-12-03 15:10:00,599 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:00,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:10:00,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:10:00,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:10:00,600 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 17 states. [2018-12-03 15:10:02,181 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-03 15:10:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:06,419 INFO L93 Difference]: Finished difference Result 1278 states and 2792 transitions. [2018-12-03 15:10:06,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:10:06,420 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 15:10:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:06,421 INFO L225 Difference]: With dead ends: 1278 [2018-12-03 15:10:06,421 INFO L226 Difference]: Without dead ends: 1270 [2018-12-03 15:10:06,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=688, Invalid=2852, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:10:06,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-12-03 15:10:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 970. [2018-12-03 15:10:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-12-03 15:10:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-12-03 15:10:07,475 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-12-03 15:10:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:07,475 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-12-03 15:10:07,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:10:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-12-03 15:10:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:10:07,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:07,476 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:07,476 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:07,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:07,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-12-03 15:10:07,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:07,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:07,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:07,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:07,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:07,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:10:07,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 15:10:07,557 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:10:07,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:10:07,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:10:07,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:10:07,558 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-12-03 15:10:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:11,086 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-12-03 15:10:11,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:10:11,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 15:10:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:11,088 INFO L225 Difference]: With dead ends: 1180 [2018-12-03 15:10:11,088 INFO L226 Difference]: Without dead ends: 1172 [2018-12-03 15:10:11,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:10:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-12-03 15:10:12,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-12-03 15:10:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-12-03 15:10:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-12-03 15:10:12,093 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-12-03 15:10:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:12,093 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-12-03 15:10:12,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:10:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-12-03 15:10:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:10:12,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:12,094 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:12,094 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:12,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:12,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-12-03 15:10:12,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:12,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:12,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:12,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:12,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:12,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:10:12,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 15:10:12,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:10:12,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:10:12,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:10:12,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:10:12,509 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-12-03 15:10:16,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:16,226 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-12-03 15:10:16,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:10:16,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 15:10:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:16,228 INFO L225 Difference]: With dead ends: 1233 [2018-12-03 15:10:16,228 INFO L226 Difference]: Without dead ends: 1225 [2018-12-03 15:10:16,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:10:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-12-03 15:10:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-12-03 15:10:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-12-03 15:10:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-12-03 15:10:18,229 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-12-03 15:10:18,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:18,229 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-12-03 15:10:18,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:10:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-12-03 15:10:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:10:18,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:18,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:18,231 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:18,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:18,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-12-03 15:10:18,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:18,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:18,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:18,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:18,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:18,589 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 15:10:18,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:10:18,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 15:10:18,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:10:18,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:10:18,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:10:18,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:10:18,590 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-12-03 15:10:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:22,826 INFO L93 Difference]: Finished difference Result 1537 states and 3410 transitions. [2018-12-03 15:10:22,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:10:22,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 15:10:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:22,828 INFO L225 Difference]: With dead ends: 1537 [2018-12-03 15:10:22,828 INFO L226 Difference]: Without dead ends: 1529 [2018-12-03 15:10:22,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:10:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-12-03 15:10:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1013. [2018-12-03 15:10:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-12-03 15:10:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-12-03 15:10:23,925 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-12-03 15:10:23,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:23,925 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-12-03 15:10:23,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:10:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-12-03 15:10:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:10:23,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:23,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:23,926 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:23,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:23,926 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-12-03 15:10:23,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:23,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:23,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:23,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:23,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:24,090 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 15:10:24,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:10:24,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 15:10:24,090 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:10:24,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:10:24,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:10:24,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:10:24,091 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-12-03 15:10:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:28,668 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-12-03 15:10:28,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:10:28,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 15:10:28,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:28,671 INFO L225 Difference]: With dead ends: 1590 [2018-12-03 15:10:28,671 INFO L226 Difference]: Without dead ends: 1582 [2018-12-03 15:10:28,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:10:28,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-12-03 15:10:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-12-03 15:10:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-12-03 15:10:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-12-03 15:10:29,789 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-12-03 15:10:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:29,789 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-12-03 15:10:29,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:10:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-12-03 15:10:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:10:29,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:29,790 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:29,790 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:29,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:29,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-12-03 15:10:29,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:29,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:29,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:29,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:29,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:29,871 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 15:10:29,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:29,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:29,872 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:10:29,872 INFO L205 CegarAbsIntRunner]: [0], [4], [59], [78], [159], [174], [183], [203], [204], [279], [283], [337], [345], [351] [2018-12-03 15:10:29,874 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:10:29,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:10:29,885 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:10:29,885 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:10:29,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:29,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:10:29,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:29,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:29,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:29,905 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:10:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:29,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:30,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:30,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:30,163 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 15:10:30,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:30,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 15:10:30,181 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:30,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:10:30,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:10:30,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:10:30,183 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 17 states. [2018-12-03 15:10:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:39,615 INFO L93 Difference]: Finished difference Result 1949 states and 4288 transitions. [2018-12-03 15:10:39,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 15:10:39,615 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 15:10:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:39,618 INFO L225 Difference]: With dead ends: 1949 [2018-12-03 15:10:39,618 INFO L226 Difference]: Without dead ends: 1941 [2018-12-03 15:10:39,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3051 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1802, Invalid=8704, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:10:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-12-03 15:10:40,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1031. [2018-12-03 15:10:40,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-12-03 15:10:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-12-03 15:10:40,907 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-12-03 15:10:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:40,907 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-12-03 15:10:40,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:10:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-12-03 15:10:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:10:40,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:40,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:40,908 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:40,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:40,909 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-12-03 15:10:40,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:40,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:40,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:40,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:40,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:41,687 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 15:10:41,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:10:41,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 15:10:41,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:10:41,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:10:41,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:10:41,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:10:41,689 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-12-03 15:10:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:46,324 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-12-03 15:10:46,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:10:46,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 15:10:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:46,326 INFO L225 Difference]: With dead ends: 1420 [2018-12-03 15:10:46,326 INFO L226 Difference]: Without dead ends: 1412 [2018-12-03 15:10:46,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:10:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-12-03 15:10:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-12-03 15:10:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-12-03 15:10:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-12-03 15:10:47,450 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-12-03 15:10:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:47,451 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-12-03 15:10:47,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:10:47,451 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-12-03 15:10:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:10:47,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:47,452 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:47,452 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:47,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:47,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-12-03 15:10:47,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:47,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:47,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:47,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:47,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:47,527 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 15:10:47,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:47,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:47,528 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:10:47,528 INFO L205 CegarAbsIntRunner]: [0], [4], [159], [174], [183], [203], [204], [279], [283], [321], [331], [339], [345], [351] [2018-12-03 15:10:47,530 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:10:47,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:10:47,539 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:10:47,539 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:10:47,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:47,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:10:47,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:47,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:47,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:47,565 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:10:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:47,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:47,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:47,807 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 15:10:47,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:47,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 15:10:47,826 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:47,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:10:47,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:10:47,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:10:47,827 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 17 states. [2018-12-03 15:11:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:01,758 INFO L93 Difference]: Finished difference Result 2767 states and 6075 transitions. [2018-12-03 15:11:01,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-12-03 15:11:01,759 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 15:11:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:01,762 INFO L225 Difference]: With dead ends: 2767 [2018-12-03 15:11:01,762 INFO L226 Difference]: Without dead ends: 2759 [2018-12-03 15:11:01,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6171 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2931, Invalid=16251, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 15:11:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-12-03 15:11:03,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1094. [2018-12-03 15:11:03,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-12-03 15:11:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2474 transitions. [2018-12-03 15:11:03,197 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2474 transitions. Word has length 16 [2018-12-03 15:11:03,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:03,197 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 2474 transitions. [2018-12-03 15:11:03,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:11:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2474 transitions. [2018-12-03 15:11:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:11:03,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:03,198 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:11:03,199 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:03,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:03,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-12-03 15:11:03,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:03,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:03,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:03,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:03,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:03,301 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 15:11:03,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:03,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:03,301 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:11:03,302 INFO L205 CegarAbsIntRunner]: [0], [4], [159], [174], [183], [203], [204], [283], [314], [323], [331], [339], [345], [351] [2018-12-03 15:11:03,303 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:11:03,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:11:03,312 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:11:03,312 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:11:03,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:03,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:11:03,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:03,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:03,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:03,336 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:11:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:03,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:03,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:03,749 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 15:11:03,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:03,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 15:11:03,770 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:03,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:11:03,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:11:03,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:11:03,771 INFO L87 Difference]: Start difference. First operand 1094 states and 2474 transitions. Second operand 17 states. [2018-12-03 15:11:17,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:17,822 INFO L93 Difference]: Finished difference Result 2361 states and 5206 transitions. [2018-12-03 15:11:17,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-12-03 15:11:17,823 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 15:11:17,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:17,826 INFO L225 Difference]: With dead ends: 2361 [2018-12-03 15:11:17,826 INFO L226 Difference]: Without dead ends: 2353 [2018-12-03 15:11:17,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9579 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3721, Invalid=24001, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 15:11:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-12-03 15:11:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1155. [2018-12-03 15:11:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-12-03 15:11:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2607 transitions. [2018-12-03 15:11:19,446 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2607 transitions. Word has length 16 [2018-12-03 15:11:19,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:19,446 INFO L480 AbstractCegarLoop]: Abstraction has 1155 states and 2607 transitions. [2018-12-03 15:11:19,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:11:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2607 transitions. [2018-12-03 15:11:19,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:11:19,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:19,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:11:19,447 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:19,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:19,447 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-12-03 15:11:19,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:19,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:19,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:19,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:19,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:19,509 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 15:11:19,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:19,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:19,510 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-12-03 15:11:19,510 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [65], [76], [84], [86], [92], [113], [120], [128], [132], [251], [260], [274], [337], [349] [2018-12-03 15:11:19,511 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:11:19,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:11:19,521 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:11:19,521 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:11:19,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:19,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:11:19,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:19,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:19,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:19,540 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:11:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:19,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:19,635 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 15:11:19,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:19,748 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 15:11:19,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:19,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-03 15:11:19,768 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:19,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:11:19,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:11:19,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:11:19,769 INFO L87 Difference]: Start difference. First operand 1155 states and 2607 transitions. Second operand 14 states. [2018-12-03 15:11:22,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:22,748 INFO L93 Difference]: Finished difference Result 1507 states and 3367 transitions. [2018-12-03 15:11:22,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:11:22,748 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-12-03 15:11:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:22,750 INFO L225 Difference]: With dead ends: 1507 [2018-12-03 15:11:22,750 INFO L226 Difference]: Without dead ends: 1502 [2018-12-03 15:11:22,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:11:22,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-12-03 15:11:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2018-12-03 15:11:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2018-12-03 15:11:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2995 transitions. [2018-12-03 15:11:24,593 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2995 transitions. Word has length 17 [2018-12-03 15:11:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:24,594 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2995 transitions. [2018-12-03 15:11:24,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:11:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2995 transitions. [2018-12-03 15:11:24,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:11:24,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:24,595 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:11:24,595 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:24,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:24,596 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-12-03 15:11:24,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:24,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:24,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:24,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:24,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:24,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:24,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:24,723 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-12-03 15:11:24,724 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [76], [84], [92], [251], [317], [323], [331], [333], [337], [339], [345], [351] [2018-12-03 15:11:24,725 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:11:24,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:11:24,741 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:11:24,742 INFO L272 AbstractInterpreter]: Visited 15 different actions 26 times. Merged at 10 different actions 10 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:11:24,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:24,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:11:24,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:24,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:24,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:24,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:11:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:24,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:25,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:25,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:25,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 15:11:25,145 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:25,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:11:25,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:11:25,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:11:25,145 INFO L87 Difference]: Start difference. First operand 1339 states and 2995 transitions. Second operand 19 states. [2018-12-03 15:11:35,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:35,667 INFO L93 Difference]: Finished difference Result 3654 states and 8066 transitions. [2018-12-03 15:11:35,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:11:35,668 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-12-03 15:11:35,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:35,671 INFO L225 Difference]: With dead ends: 3654 [2018-12-03 15:11:35,672 INFO L226 Difference]: Without dead ends: 3646 [2018-12-03 15:11:35,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1451 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1245, Invalid=4011, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 15:11:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2018-12-03 15:11:38,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 2136. [2018-12-03 15:11:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-12-03 15:11:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4855 transitions. [2018-12-03 15:11:38,494 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4855 transitions. Word has length 17 [2018-12-03 15:11:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:38,494 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4855 transitions. [2018-12-03 15:11:38,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:11:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4855 transitions. [2018-12-03 15:11:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:11:38,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:38,495 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:11:38,495 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:38,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:38,496 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-12-03 15:11:38,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:38,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:38,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:38,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:38,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:11:38,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:38,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:38,574 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:11:38,575 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [76], [84], [86], [92], [132], [203], [236], [245], [252], [254], [337], [345], [351] [2018-12-03 15:11:38,576 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:11:38,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:11:38,587 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:11:38,587 INFO L272 AbstractInterpreter]: Visited 16 different actions 22 times. Merged at 5 different actions 5 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:11:38,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:38,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:11:38,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:38,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:38,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:38,609 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:11:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:38,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:11:38,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:11:38,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:38,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 15:11:38,699 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:38,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:11:38,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:11:38,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:11:38,699 INFO L87 Difference]: Start difference. First operand 2136 states and 4855 transitions. Second operand 11 states. [2018-12-03 15:11:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:44,281 INFO L93 Difference]: Finished difference Result 2767 states and 6209 transitions. [2018-12-03 15:11:44,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:11:44,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:11:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:44,285 INFO L225 Difference]: With dead ends: 2767 [2018-12-03 15:11:44,285 INFO L226 Difference]: Without dead ends: 2759 [2018-12-03 15:11:44,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:11:44,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-12-03 15:11:47,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2216. [2018-12-03 15:11:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-12-03 15:11:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5027 transitions. [2018-12-03 15:11:47,220 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5027 transitions. Word has length 20 [2018-12-03 15:11:47,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:47,221 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5027 transitions. [2018-12-03 15:11:47,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:11:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5027 transitions. [2018-12-03 15:11:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:11:47,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:47,222 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:11:47,222 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:47,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-12-03 15:11:47,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:47,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:47,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:47,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:47,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:11:47,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:47,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:47,380 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:11:47,380 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [76], [84], [86], [92], [94], [98], [132], [203], [236], [245], [252], [337], [345], [351] [2018-12-03 15:11:47,381 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:11:47,381 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:11:47,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:11:47,400 INFO L272 AbstractInterpreter]: Visited 17 different actions 25 times. Merged at 6 different actions 6 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:11:47,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:47,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:11:47,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:47,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:47,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:47,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:11:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:47,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:11:47,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:11:47,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:47,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 15:11:47,503 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:47,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:11:47,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:11:47,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:11:47,504 INFO L87 Difference]: Start difference. First operand 2216 states and 5027 transitions. Second operand 11 states. [2018-12-03 15:11:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:53,616 INFO L93 Difference]: Finished difference Result 3146 states and 7011 transitions. [2018-12-03 15:11:53,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:11:53,616 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:11:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:53,620 INFO L225 Difference]: With dead ends: 3146 [2018-12-03 15:11:53,620 INFO L226 Difference]: Without dead ends: 3138 [2018-12-03 15:11:53,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:11:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-12-03 15:11:56,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2248. [2018-12-03 15:11:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-12-03 15:11:56,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5091 transitions. [2018-12-03 15:11:56,556 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5091 transitions. Word has length 20 [2018-12-03 15:11:56,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:56,556 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5091 transitions. [2018-12-03 15:11:56,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:11:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5091 transitions. [2018-12-03 15:11:56,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:11:56,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:56,557 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:11:56,557 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:56,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:56,558 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-12-03 15:11:56,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:56,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:56,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:56,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:56,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:11:56,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:56,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:56,637 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:11:56,638 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [76], [84], [86], [92], [94], [102], [132], [183], [203], [229], [252], [337], [345], [351] [2018-12-03 15:11:56,638 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:11:56,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:11:56,651 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:11:56,651 INFO L272 AbstractInterpreter]: Visited 17 different actions 27 times. Merged at 8 different actions 8 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:11:56,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:56,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:11:56,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:56,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:56,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:56,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:11:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:56,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:11:56,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:11:56,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:56,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 15:11:56,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:56,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:11:56,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:11:56,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:11:56,763 INFO L87 Difference]: Start difference. First operand 2248 states and 5091 transitions. Second operand 11 states. [2018-12-03 15:12:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:03,471 INFO L93 Difference]: Finished difference Result 3089 states and 6919 transitions. [2018-12-03 15:12:03,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:12:03,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:12:03,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:03,475 INFO L225 Difference]: With dead ends: 3089 [2018-12-03 15:12:03,475 INFO L226 Difference]: Without dead ends: 3081 [2018-12-03 15:12:03,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:12:03,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-12-03 15:12:06,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2246. [2018-12-03 15:12:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-12-03 15:12:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5087 transitions. [2018-12-03 15:12:06,401 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5087 transitions. Word has length 20 [2018-12-03 15:12:06,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:06,402 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5087 transitions. [2018-12-03 15:12:06,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:12:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5087 transitions. [2018-12-03 15:12:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:12:06,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:06,403 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:06,403 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:06,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:06,404 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-12-03 15:12:06,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:06,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:06,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:06,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:06,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:06,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:06,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:06,506 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:12:06,506 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [55], [76], [78], [84], [86], [92], [98], [132], [203], [236], [245], [252], [292], [337], [345], [351] [2018-12-03 15:12:06,507 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:06,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:06,520 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:06,520 INFO L272 AbstractInterpreter]: Visited 19 different actions 29 times. Merged at 8 different actions 8 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:12:06,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:06,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:06,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:06,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:06,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:06,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:06,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:06,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:06,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:06,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 15:12:06,597 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:06,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:12:06,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:12:06,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:12:06,598 INFO L87 Difference]: Start difference. First operand 2246 states and 5087 transitions. Second operand 11 states. [2018-12-03 15:12:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:13,126 INFO L93 Difference]: Finished difference Result 3266 states and 7250 transitions. [2018-12-03 15:12:13,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:12:13,126 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:12:13,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:13,130 INFO L225 Difference]: With dead ends: 3266 [2018-12-03 15:12:13,130 INFO L226 Difference]: Without dead ends: 3258 [2018-12-03 15:12:13,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:12:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2018-12-03 15:12:16,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2328. [2018-12-03 15:12:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2328 states. [2018-12-03 15:12:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 5263 transitions. [2018-12-03 15:12:16,178 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 5263 transitions. Word has length 20 [2018-12-03 15:12:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:16,179 INFO L480 AbstractCegarLoop]: Abstraction has 2328 states and 5263 transitions. [2018-12-03 15:12:16,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:12:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 5263 transitions. [2018-12-03 15:12:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:12:16,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:16,180 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:16,180 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:16,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:16,180 INFO L82 PathProgramCache]: Analyzing trace with hash 718975582, now seen corresponding path program 1 times [2018-12-03 15:12:16,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:16,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:16,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:16,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:16,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:16,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:16,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:16,317 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:12:16,318 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [55], [76], [78], [84], [86], [92], [102], [132], [183], [203], [229], [252], [292], [337], [345], [351] [2018-12-03 15:12:16,319 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:16,319 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:16,332 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:16,332 INFO L272 AbstractInterpreter]: Visited 19 different actions 31 times. Merged at 10 different actions 10 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:12:16,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:16,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:16,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:16,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:16,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:16,357 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:16,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:16,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:16,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:16,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 15:12:16,471 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:16,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:12:16,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:12:16,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:12:16,472 INFO L87 Difference]: Start difference. First operand 2328 states and 5263 transitions. Second operand 11 states. [2018-12-03 15:12:24,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:24,058 INFO L93 Difference]: Finished difference Result 3498 states and 7776 transitions. [2018-12-03 15:12:24,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:12:24,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:12:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:24,063 INFO L225 Difference]: With dead ends: 3498 [2018-12-03 15:12:24,063 INFO L226 Difference]: Without dead ends: 3490 [2018-12-03 15:12:24,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=553, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:12:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2018-12-03 15:12:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2262. [2018-12-03 15:12:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-12-03 15:12:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 5119 transitions. [2018-12-03 15:12:27,104 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 5119 transitions. Word has length 20 [2018-12-03 15:12:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:27,104 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 5119 transitions. [2018-12-03 15:12:27,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:12:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 5119 transitions. [2018-12-03 15:12:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:12:27,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:27,105 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:27,105 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:27,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:27,106 INFO L82 PathProgramCache]: Analyzing trace with hash 826825729, now seen corresponding path program 1 times [2018-12-03 15:12:27,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:27,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:27,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:27,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:27,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:27,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:27,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:27,860 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:12:27,860 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [59], [76], [78], [84], [86], [92], [132], [174], [183], [203], [252], [279], [283], [337], [345], [351] [2018-12-03 15:12:27,861 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:27,861 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:27,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:27,874 INFO L272 AbstractInterpreter]: Visited 19 different actions 31 times. Merged at 10 different actions 10 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:12:27,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:27,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:27,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:27,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:27,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:27,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:27,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:27,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:27,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:27,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 15:12:27,975 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:27,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:12:27,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:12:27,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:12:27,976 INFO L87 Difference]: Start difference. First operand 2262 states and 5119 transitions. Second operand 11 states. [2018-12-03 15:12:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:34,910 INFO L93 Difference]: Finished difference Result 3139 states and 7021 transitions. [2018-12-03 15:12:34,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:12:34,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:12:34,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:34,914 INFO L225 Difference]: With dead ends: 3139 [2018-12-03 15:12:34,914 INFO L226 Difference]: Without dead ends: 3131 [2018-12-03 15:12:34,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=236, Invalid=520, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:12:34,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2018-12-03 15:12:37,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 2262. [2018-12-03 15:12:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-12-03 15:12:37,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 5119 transitions. [2018-12-03 15:12:37,910 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 5119 transitions. Word has length 20 [2018-12-03 15:12:37,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:37,910 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 5119 transitions. [2018-12-03 15:12:37,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:12:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 5119 transitions. [2018-12-03 15:12:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:12:37,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:37,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:37,912 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:37,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:37,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1854611284, now seen corresponding path program 1 times [2018-12-03 15:12:37,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:37,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:37,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:37,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:38,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:38,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:38,119 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:12:38,119 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [55], [76], [84], [86], [92], [98], [132], [203], [236], [245], [252], [292], [327], [337], [339], [345], [351] [2018-12-03 15:12:38,121 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:38,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:38,133 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:38,133 INFO L272 AbstractInterpreter]: Visited 20 different actions 31 times. Merged at 9 different actions 9 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:12:38,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:38,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:38,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:38,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:38,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:38,151 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:38,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:38,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:38,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:38,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 15:12:38,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:38,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:12:38,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:12:38,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:12:38,241 INFO L87 Difference]: Start difference. First operand 2262 states and 5119 transitions. Second operand 11 states. [2018-12-03 15:12:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:44,242 INFO L93 Difference]: Finished difference Result 2951 states and 6564 transitions. [2018-12-03 15:12:44,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:12:44,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:12:44,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:44,246 INFO L225 Difference]: With dead ends: 2951 [2018-12-03 15:12:44,246 INFO L226 Difference]: Without dead ends: 2943 [2018-12-03 15:12:44,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:12:44,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2018-12-03 15:12:47,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2202. [2018-12-03 15:12:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2018-12-03 15:12:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 4975 transitions. [2018-12-03 15:12:47,287 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 4975 transitions. Word has length 20 [2018-12-03 15:12:47,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:47,287 INFO L480 AbstractCegarLoop]: Abstraction has 2202 states and 4975 transitions. [2018-12-03 15:12:47,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:12:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 4975 transitions. [2018-12-03 15:12:47,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:12:47,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:47,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:47,288 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:47,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:47,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1854713429, now seen corresponding path program 1 times [2018-12-03 15:12:47,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:47,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:47,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:47,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:47,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:47,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:47,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:47,385 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:12:47,386 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [55], [76], [84], [86], [92], [102], [132], [183], [203], [229], [252], [292], [327], [337], [339], [345], [351] [2018-12-03 15:12:47,386 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:47,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:47,411 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:47,412 INFO L272 AbstractInterpreter]: Visited 20 different actions 33 times. Merged at 11 different actions 11 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:12:47,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:47,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:47,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:47,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:47,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:47,424 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:47,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:47,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:47,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:47,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 15:12:47,523 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:47,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:12:47,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:12:47,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:12:47,523 INFO L87 Difference]: Start difference. First operand 2202 states and 4975 transitions. Second operand 11 states. [2018-12-03 15:12:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:54,818 INFO L93 Difference]: Finished difference Result 3183 states and 7090 transitions. [2018-12-03 15:12:54,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:12:54,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:12:54,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:54,821 INFO L225 Difference]: With dead ends: 3183 [2018-12-03 15:12:54,821 INFO L226 Difference]: Without dead ends: 3175 [2018-12-03 15:12:54,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:12:54,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2018-12-03 15:12:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2136. [2018-12-03 15:12:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-12-03 15:12:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4831 transitions. [2018-12-03 15:12:57,791 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4831 transitions. Word has length 20 [2018-12-03 15:12:57,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:57,791 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4831 transitions. [2018-12-03 15:12:57,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:12:57,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4831 transitions. [2018-12-03 15:12:57,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:12:57,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:57,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:57,792 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:57,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:57,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1962563576, now seen corresponding path program 1 times [2018-12-03 15:12:57,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:57,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:57,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:57,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:57,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:57,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:57,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:57,872 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:12:57,872 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [59], [76], [84], [86], [92], [132], [174], [183], [203], [252], [279], [283], [327], [337], [339], [345], [351] [2018-12-03 15:12:57,873 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:57,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:57,886 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:57,886 INFO L272 AbstractInterpreter]: Visited 20 different actions 33 times. Merged at 11 different actions 11 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:12:57,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:57,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:57,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:57,898 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:57,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:57,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:57,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:57,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:12:57,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:57,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 15:12:57,994 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:57,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:12:57,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:12:57,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:12:57,995 INFO L87 Difference]: Start difference. First operand 2136 states and 4831 transitions. Second operand 11 states. [2018-12-03 15:13:05,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:13:05,327 INFO L93 Difference]: Finished difference Result 3044 states and 6774 transitions. [2018-12-03 15:13:05,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:13:05,327 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:13:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:13:05,331 INFO L225 Difference]: With dead ends: 3044 [2018-12-03 15:13:05,331 INFO L226 Difference]: Without dead ends: 3036 [2018-12-03 15:13:05,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=520, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:13:05,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2018-12-03 15:13:08,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 1834. [2018-12-03 15:13:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2018-12-03 15:13:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 4141 transitions. [2018-12-03 15:13:08,007 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 4141 transitions. Word has length 20 [2018-12-03 15:13:08,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:13:08,007 INFO L480 AbstractCegarLoop]: Abstraction has 1834 states and 4141 transitions. [2018-12-03 15:13:08,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:13:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 4141 transitions. [2018-12-03 15:13:08,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:13:08,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:13:08,008 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:13:08,008 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:13:08,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:13:08,009 INFO L82 PathProgramCache]: Analyzing trace with hash 371911669, now seen corresponding path program 1 times [2018-12-03 15:13:08,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:13:08,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:08,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:13:08,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:08,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:13:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:13:08,099 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 15:13:08,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:08,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:13:08,099 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 15:13:08,099 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [59], [65], [72], [78], [113], [120], [126], [260], [262], [274], [279], [285], [343], [349] [2018-12-03 15:13:08,100 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:13:08,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:13:08,111 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:13:08,111 INFO L272 AbstractInterpreter]: Visited 17 different actions 27 times. Merged at 10 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:13:08,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:13:08,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:13:08,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:08,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:13:08,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:13:08,161 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:13:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:13:08,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:13:08,314 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 15:13:08,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:13:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:08,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:13:08,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2018-12-03 15:13:08,486 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:13:08,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:13:08,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:13:08,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:13:08,486 INFO L87 Difference]: Start difference. First operand 1834 states and 4141 transitions. Second operand 20 states. [2018-12-03 15:13:17,562 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-12-03 15:13:28,406 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:13:31,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:13:31,372 INFO L93 Difference]: Finished difference Result 5972 states and 13233 transitions. [2018-12-03 15:13:31,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-12-03 15:13:31,372 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-12-03 15:13:31,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:13:31,378 INFO L225 Difference]: With dead ends: 5972 [2018-12-03 15:13:31,378 INFO L226 Difference]: Without dead ends: 5964 [2018-12-03 15:13:31,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6656 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3054, Invalid=16128, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 15:13:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2018-12-03 15:13:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3311. [2018-12-03 15:13:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3311 states. [2018-12-03 15:13:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 7569 transitions. [2018-12-03 15:13:36,285 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 7569 transitions. Word has length 21 [2018-12-03 15:13:36,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:13:36,285 INFO L480 AbstractCegarLoop]: Abstraction has 3311 states and 7569 transitions. [2018-12-03 15:13:36,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:13:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 7569 transitions. [2018-12-03 15:13:36,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:13:36,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:13:36,287 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:13:36,287 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:13:36,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:13:36,287 INFO L82 PathProgramCache]: Analyzing trace with hash -461254251, now seen corresponding path program 2 times [2018-12-03 15:13:36,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:13:36,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:36,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:13:36,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:36,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:13:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:13:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:36,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:36,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:13:36,435 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:13:36,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:13:36,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:36,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:13:36,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:13:36,447 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:13:36,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:13:36,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:13:36,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:13:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:36,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:13:36,725 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 15:13:36,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:13:36,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2018-12-03 15:13:36,745 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:13:36,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:13:36,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:13:36,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:13:36,746 INFO L87 Difference]: Start difference. First operand 3311 states and 7569 transitions. Second operand 21 states. [2018-12-03 15:13:59,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:13:59,068 INFO L93 Difference]: Finished difference Result 6725 states and 15108 transitions. [2018-12-03 15:13:59,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 15:13:59,068 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 15:13:59,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:13:59,076 INFO L225 Difference]: With dead ends: 6725 [2018-12-03 15:13:59,076 INFO L226 Difference]: Without dead ends: 6717 [2018-12-03 15:13:59,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3727 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2202, Invalid=10454, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 15:13:59,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6717 states. [2018-12-03 15:14:02,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6717 to 2426. [2018-12-03 15:14:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2018-12-03 15:14:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 5536 transitions. [2018-12-03 15:14:02,906 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 5536 transitions. Word has length 21 [2018-12-03 15:14:02,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:14:02,907 INFO L480 AbstractCegarLoop]: Abstraction has 2426 states and 5536 transitions. [2018-12-03 15:14:02,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:14:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 5536 transitions. [2018-12-03 15:14:02,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:14:02,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:14:02,908 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:14:02,908 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:14:02,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:02,908 INFO L82 PathProgramCache]: Analyzing trace with hash 504785992, now seen corresponding path program 1 times [2018-12-03 15:14:02,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:14:02,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:02,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:14:02,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:02,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:14:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:02,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:02,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:14:02,989 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:14:02,989 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [92], [113], [120], [122], [128], [132], [199], [203], [207], [224], [236], [245], [247], [254], [260], [274], [349] [2018-12-03 15:14:02,990 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:14:02,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:14:03,001 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:14:03,001 INFO L272 AbstractInterpreter]: Visited 21 different actions 32 times. Merged at 9 different actions 9 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:14:03,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:03,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:14:03,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:03,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:14:03,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:03,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:14:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:03,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:14:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:03,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:14:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:03,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:14:03,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:14:03,202 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:14:03,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:14:03,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:14:03,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:14:03,203 INFO L87 Difference]: Start difference. First operand 2426 states and 5536 transitions. Second operand 13 states. [2018-12-03 15:14:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:14:16,505 INFO L93 Difference]: Finished difference Result 8061 states and 18335 transitions. [2018-12-03 15:14:16,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:14:16,506 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 15:14:16,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:14:16,512 INFO L225 Difference]: With dead ends: 8061 [2018-12-03 15:14:16,512 INFO L226 Difference]: Without dead ends: 5636 [2018-12-03 15:14:16,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=533, Invalid=1537, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:14:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5636 states. [2018-12-03 15:14:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5636 to 3316. [2018-12-03 15:14:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3316 states. [2018-12-03 15:14:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 7500 transitions. [2018-12-03 15:14:21,754 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 7500 transitions. Word has length 24 [2018-12-03 15:14:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:14:21,755 INFO L480 AbstractCegarLoop]: Abstraction has 3316 states and 7500 transitions. [2018-12-03 15:14:21,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:14:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 7500 transitions. [2018-12-03 15:14:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:14:21,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:14:21,756 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:14:21,756 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:14:21,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:21,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1269424552, now seen corresponding path program 1 times [2018-12-03 15:14:21,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:14:21,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:21,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:21,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:21,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:14:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:21,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:21,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:14:21,831 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:14:21,831 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [98], [113], [120], [122], [128], [132], [199], [203], [207], [224], [236], [245], [247], [254], [260], [274], [292], [349] [2018-12-03 15:14:21,832 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:14:21,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:14:21,843 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:14:21,844 INFO L272 AbstractInterpreter]: Visited 22 different actions 34 times. Merged at 10 different actions 10 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:14:21,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:21,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:14:21,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:21,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:14:21,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:21,903 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:14:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:21,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:14:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:22,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:14:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:22,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:14:22,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-12-03 15:14:22,135 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:14:22,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:14:22,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:14:22,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:14:22,136 INFO L87 Difference]: Start difference. First operand 3316 states and 7500 transitions. Second operand 14 states. [2018-12-03 15:14:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:14:35,258 INFO L93 Difference]: Finished difference Result 9123 states and 20565 transitions. [2018-12-03 15:14:35,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:14:35,258 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-03 15:14:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:14:35,264 INFO L225 Difference]: With dead ends: 9123 [2018-12-03 15:14:35,264 INFO L226 Difference]: Without dead ends: 5808 [2018-12-03 15:14:35,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=416, Invalid=1306, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:14:35,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5808 states. [2018-12-03 15:14:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5808 to 3396. [2018-12-03 15:14:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3396 states. [2018-12-03 15:14:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 7743 transitions. [2018-12-03 15:14:40,722 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 7743 transitions. Word has length 24 [2018-12-03 15:14:40,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:14:40,723 INFO L480 AbstractCegarLoop]: Abstraction has 3396 states and 7743 transitions. [2018-12-03 15:14:40,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:14:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 7743 transitions. [2018-12-03 15:14:40,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:14:40,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:14:40,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:14:40,724 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:14:40,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:40,725 INFO L82 PathProgramCache]: Analyzing trace with hash -277435291, now seen corresponding path program 1 times [2018-12-03 15:14:40,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:14:40,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:40,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:40,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:40,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:14:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:41,242 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 15:14:41,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:41,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:14:41,242 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:14:41,242 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [98], [113], [120], [122], [128], [132], [179], [203], [217], [224], [236], [245], [247], [254], [260], [274], [292], [298], [310], [349] [2018-12-03 15:14:41,243 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:14:41,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:14:41,266 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:14:41,266 INFO L272 AbstractInterpreter]: Visited 24 different actions 38 times. Merged at 11 different actions 11 times. Never widened. Found 6 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 15:14:41,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:41,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:14:41,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:41,275 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:14:41,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:41,285 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:14:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:41,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:14:41,406 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 15:14:41,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:14:41,488 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 15:14:41,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:14:41,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2018-12-03 15:14:41,507 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:14:41,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:14:41,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:14:41,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:14:41,508 INFO L87 Difference]: Start difference. First operand 3396 states and 7743 transitions. Second operand 15 states. [2018-12-03 15:14:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:14:56,708 INFO L93 Difference]: Finished difference Result 9753 states and 22123 transitions. [2018-12-03 15:14:56,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:14:56,708 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-12-03 15:14:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:14:56,715 INFO L225 Difference]: With dead ends: 9753 [2018-12-03 15:14:56,715 INFO L226 Difference]: Without dead ends: 6358 [2018-12-03 15:14:56,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=766, Invalid=2204, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:14:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6358 states. [2018-12-03 15:15:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6358 to 4049. [2018-12-03 15:15:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2018-12-03 15:15:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 9311 transitions. [2018-12-03 15:15:03,166 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 9311 transitions. Word has length 24 [2018-12-03 15:15:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:15:03,166 INFO L480 AbstractCegarLoop]: Abstraction has 4049 states and 9311 transitions. [2018-12-03 15:15:03,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:15:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 9311 transitions. [2018-12-03 15:15:03,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:15:03,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:15:03,168 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:15:03,168 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:15:03,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:03,168 INFO L82 PathProgramCache]: Analyzing trace with hash -290450663, now seen corresponding path program 1 times [2018-12-03 15:15:03,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:15:03,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:03,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:03,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:03,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:15:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:03,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:03,255 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:15:03,256 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:15:03,256 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [113], [120], [122], [128], [132], [179], [203], [217], [236], [245], [254], [260], [274], [298], [300], [310], [349] [2018-12-03 15:15:03,257 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:15:03,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:15:03,286 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:15:03,287 INFO L272 AbstractInterpreter]: Visited 21 different actions 38 times. Merged at 12 different actions 15 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:15:03,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:03,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:15:03,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:03,323 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:15:03,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:03,339 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:15:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:03,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:15:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:03,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:15:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:03,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:15:03,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2018-12-03 15:15:03,583 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:15:03,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:15:03,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:15:03,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:15:03,583 INFO L87 Difference]: Start difference. First operand 4049 states and 9311 transitions. Second operand 15 states. [2018-12-03 15:15:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:15:17,793 INFO L93 Difference]: Finished difference Result 10048 states and 22999 transitions. [2018-12-03 15:15:17,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:15:17,793 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-12-03 15:15:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:15:17,800 INFO L225 Difference]: With dead ends: 10048 [2018-12-03 15:15:17,800 INFO L226 Difference]: Without dead ends: 6000 [2018-12-03 15:15:17,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=762, Invalid=1994, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:15:17,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2018-12-03 15:15:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 4263. [2018-12-03 15:15:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2018-12-03 15:15:24,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 9793 transitions. [2018-12-03 15:15:24,634 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 9793 transitions. Word has length 24 [2018-12-03 15:15:24,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:15:24,635 INFO L480 AbstractCegarLoop]: Abstraction has 4263 states and 9793 transitions. [2018-12-03 15:15:24,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:15:24,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 9793 transitions. [2018-12-03 15:15:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:15:24,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:15:24,637 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:15:24,637 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:15:24,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:24,637 INFO L82 PathProgramCache]: Analyzing trace with hash 481433400, now seen corresponding path program 1 times [2018-12-03 15:15:24,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:15:24,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:24,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:24,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:24,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:15:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:24,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:24,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:15:24,726 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:15:24,727 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [98], [113], [120], [122], [128], [134], [138], [199], [203], [207], [224], [236], [245], [247], [254], [260], [274], [292], [349] [2018-12-03 15:15:24,728 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:15:24,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:15:24,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:15:24,741 INFO L272 AbstractInterpreter]: Visited 22 different actions 34 times. Merged at 10 different actions 10 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:15:24,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:24,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:15:24,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:24,766 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:15:24,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:24,782 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:15:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:24,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:15:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:24,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:15:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:25,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:15:25,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-12-03 15:15:25,055 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:15:25,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:15:25,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:15:25,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:15:25,056 INFO L87 Difference]: Start difference. First operand 4263 states and 9793 transitions. Second operand 14 states. [2018-12-03 15:15:41,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:15:41,132 INFO L93 Difference]: Finished difference Result 11665 states and 26624 transitions. [2018-12-03 15:15:41,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:15:41,133 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-03 15:15:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:15:41,140 INFO L225 Difference]: With dead ends: 11665 [2018-12-03 15:15:41,140 INFO L226 Difference]: Without dead ends: 7403 [2018-12-03 15:15:41,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=567, Invalid=1689, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:15:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7403 states. [2018-12-03 15:15:48,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7403 to 4888. [2018-12-03 15:15:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2018-12-03 15:15:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 11268 transitions. [2018-12-03 15:15:48,728 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 11268 transitions. Word has length 24 [2018-12-03 15:15:48,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:15:48,728 INFO L480 AbstractCegarLoop]: Abstraction has 4888 states and 11268 transitions. [2018-12-03 15:15:48,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:15:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 11268 transitions. [2018-12-03 15:15:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:15:48,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:15:48,731 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:15:48,731 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:15:48,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:48,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1900063568, now seen corresponding path program 1 times [2018-12-03 15:15:48,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:15:48,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:48,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:48,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:48,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:15:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:48,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:48,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:15:48,882 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:15:48,882 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [113], [120], [122], [128], [134], [142], [144], [148], [155], [162], [168], [203], [236], [245], [254], [260], [274], [349] [2018-12-03 15:15:48,883 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:15:48,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:15:48,904 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:15:48,905 INFO L272 AbstractInterpreter]: Visited 21 different actions 38 times. Merged at 12 different actions 15 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:15:48,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:48,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:15:48,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:48,934 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:15:48,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:48,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:15:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:48,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:15:49,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:49,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:15:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:49,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:15:49,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-12-03 15:15:49,374 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:15:49,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:15:49,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:15:49,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:15:49,375 INFO L87 Difference]: Start difference. First operand 4888 states and 11268 transitions. Second operand 14 states. [2018-12-03 15:16:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:16:05,909 INFO L93 Difference]: Finished difference Result 12914 states and 29867 transitions. [2018-12-03 15:16:05,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:16:05,909 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-03 15:16:05,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:16:05,919 INFO L225 Difference]: With dead ends: 12914 [2018-12-03 15:16:05,919 INFO L226 Difference]: Without dead ends: 8027 [2018-12-03 15:16:05,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=671, Invalid=1779, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:16:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8027 states. [2018-12-03 15:16:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8027 to 5552. [2018-12-03 15:16:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5552 states. [2018-12-03 15:16:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 12965 transitions. [2018-12-03 15:16:14,498 INFO L78 Accepts]: Start accepts. Automaton has 5552 states and 12965 transitions. Word has length 24 [2018-12-03 15:16:14,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:16:14,499 INFO L480 AbstractCegarLoop]: Abstraction has 5552 states and 12965 transitions. [2018-12-03 15:16:14,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:16:14,499 INFO L276 IsEmpty]: Start isEmpty. Operand 5552 states and 12965 transitions. [2018-12-03 15:16:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:16:14,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:16:14,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:16:14,502 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:16:14,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:14,502 INFO L82 PathProgramCache]: Analyzing trace with hash -563138598, now seen corresponding path program 1 times [2018-12-03 15:16:14,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:16:14,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:14,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:16:14,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:14,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:16:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:14,566 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 15:16:14,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:14,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:16:14,566 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:16:14,567 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [98], [113], [120], [122], [128], [134], [138], [142], [155], [162], [168], [203], [224], [236], [245], [247], [254], [260], [274], [292], [349] [2018-12-03 15:16:14,567 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:16:14,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:16:14,577 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:16:14,577 INFO L272 AbstractInterpreter]: Visited 24 different actions 38 times. Merged at 11 different actions 11 times. Never widened. Found 6 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 15:16:14,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:14,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:16:14,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:14,584 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:16:14,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:16:14,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:16:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:14,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:16:14,713 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 15:16:14,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:16:14,789 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 15:16:14,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:16:14,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2018-12-03 15:16:14,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:16:14,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:16:14,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:16:14,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:16:14,811 INFO L87 Difference]: Start difference. First operand 5552 states and 12965 transitions. Second operand 14 states. [2018-12-03 15:16:32,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:16:32,009 INFO L93 Difference]: Finished difference Result 13640 states and 31538 transitions. [2018-12-03 15:16:32,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:16:32,009 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-03 15:16:32,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:16:32,019 INFO L225 Difference]: With dead ends: 13640 [2018-12-03 15:16:32,019 INFO L226 Difference]: Without dead ends: 8089 [2018-12-03 15:16:32,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=730, Invalid=2026, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:16:32,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8089 states. [2018-12-03 15:16:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8089 to 5556. [2018-12-03 15:16:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5556 states. [2018-12-03 15:16:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 12957 transitions. [2018-12-03 15:16:40,745 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 12957 transitions. Word has length 24 [2018-12-03 15:16:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:16:40,745 INFO L480 AbstractCegarLoop]: Abstraction has 5556 states and 12957 transitions. [2018-12-03 15:16:40,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:16:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 12957 transitions. [2018-12-03 15:16:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:16:40,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:16:40,748 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:16:40,748 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:16:40,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1568457909, now seen corresponding path program 1 times [2018-12-03 15:16:40,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:16:40,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:40,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:16:40,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:40,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:16:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:41,011 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 15:16:41,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:41,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:16:41,012 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:16:41,012 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [92], [113], [115], [120], [122], [126], [199], [203], [207], [224], [236], [245], [247], [254], [260], [274], [349] [2018-12-03 15:16:41,013 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:16:41,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:16:41,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:16:41,024 INFO L272 AbstractInterpreter]: Visited 20 different actions 36 times. Merged at 9 different actions 12 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 15:16:41,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:41,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:16:41,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:41,058 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:16:41,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:16:41,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:16:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:41,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:16:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:16:41,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:16:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:16:42,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:16:42,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2018-12-03 15:16:42,456 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:16:42,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:16:42,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:16:42,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:16:42,457 INFO L87 Difference]: Start difference. First operand 5556 states and 12957 transitions. Second operand 19 states. [2018-12-03 15:17:40,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:17:40,249 INFO L93 Difference]: Finished difference Result 24779 states and 57605 transitions. [2018-12-03 15:17:40,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 285 states. [2018-12-03 15:17:40,249 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 15:17:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:17:40,277 INFO L225 Difference]: With dead ends: 24779 [2018-12-03 15:17:40,277 INFO L226 Difference]: Without dead ends: 19224 [2018-12-03 15:17:40,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38328 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=8035, Invalid=81665, Unknown=0, NotChecked=0, Total=89700 [2018-12-03 15:17:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19224 states. [2018-12-03 15:17:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19224 to 9944. [2018-12-03 15:17:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9944 states. [2018-12-03 15:17:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9944 states to 9944 states and 23419 transitions. [2018-12-03 15:17:56,369 INFO L78 Accepts]: Start accepts. Automaton has 9944 states and 23419 transitions. Word has length 24 [2018-12-03 15:17:56,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:17:56,369 INFO L480 AbstractCegarLoop]: Abstraction has 9944 states and 23419 transitions. [2018-12-03 15:17:56,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:17:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 9944 states and 23419 transitions. [2018-12-03 15:17:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:17:56,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:17:56,373 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:17:56,373 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:17:56,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:17:56,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1340769778, now seen corresponding path program 1 times [2018-12-03 15:17:56,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:17:56,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:17:56,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:17:56,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:17:56,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:17:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:17:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:17:56,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:17:56,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:17:56,531 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:17:56,531 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [92], [113], [120], [122], [126], [199], [203], [207], [224], [236], [245], [247], [254], [260], [264], [274], [349] [2018-12-03 15:17:56,532 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:17:56,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:17:56,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:17:56,542 INFO L272 AbstractInterpreter]: Visited 21 different actions 39 times. Merged at 10 different actions 14 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 15:17:56,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:17:56,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:17:56,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:17:56,558 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:17:56,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:17:56,567 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:17:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:17:56,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:17:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:17:56,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:17:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:17:56,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:17:56,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2018-12-03 15:17:56,809 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:17:56,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:17:56,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:17:56,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:17:56,810 INFO L87 Difference]: Start difference. First operand 9944 states and 23419 transitions. Second operand 19 states. [2018-12-03 15:18:48,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:18:48,696 INFO L93 Difference]: Finished difference Result 32192 states and 74985 transitions. [2018-12-03 15:18:48,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-12-03 15:18:48,697 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 15:18:48,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:18:48,727 INFO L225 Difference]: With dead ends: 32192 [2018-12-03 15:18:48,727 INFO L226 Difference]: Without dead ends: 22249 [2018-12-03 15:18:48,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7823 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2570, Invalid=19482, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 15:18:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22249 states. [2018-12-03 15:19:06,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22249 to 10853. [2018-12-03 15:19:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10853 states. [2018-12-03 15:19:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10853 states to 10853 states and 25572 transitions. [2018-12-03 15:19:06,764 INFO L78 Accepts]: Start accepts. Automaton has 10853 states and 25572 transitions. Word has length 24 [2018-12-03 15:19:06,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:19:06,764 INFO L480 AbstractCegarLoop]: Abstraction has 10853 states and 25572 transitions. [2018-12-03 15:19:06,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:19:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 10853 states and 25572 transitions. [2018-12-03 15:19:06,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:19:06,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:19:06,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:19:06,768 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:19:06,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:19:06,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1338856576, now seen corresponding path program 1 times [2018-12-03 15:19:06,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:19:06,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:19:06,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:19:06,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:19:06,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:19:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:19:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:19:07,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:19:07,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:19:07,070 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:19:07,070 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [94], [98], [102], [104], [110], [113], [115], [120], [126], [186], [192], [203], [229], [236], [245], [260], [264], [274], [292], [349] [2018-12-03 15:19:07,071 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:19:07,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:19:07,097 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:19:07,097 INFO L272 AbstractInterpreter]: Visited 24 different actions 62 times. Merged at 16 different actions 27 times. Widened at 2 different actions 2 times. Found 15 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 15:19:07,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:19:07,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:19:07,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:19:07,134 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:19:07,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:19:07,150 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:19:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:19:07,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:19:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:19:07,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:19:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:19:08,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:19:08,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2018-12-03 15:19:08,280 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:19:08,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:19:08,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:19:08,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:19:08,281 INFO L87 Difference]: Start difference. First operand 10853 states and 25572 transitions. Second operand 19 states. [2018-12-03 15:19:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:19:42,573 INFO L93 Difference]: Finished difference Result 25628 states and 59763 transitions. [2018-12-03 15:19:42,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:19:42,573 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 15:19:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:19:42,590 INFO L225 Difference]: With dead ends: 25628 [2018-12-03 15:19:42,590 INFO L226 Difference]: Without dead ends: 14776 [2018-12-03 15:19:42,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1842 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=790, Invalid=6016, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:19:42,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14776 states. [2018-12-03 15:20:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14776 to 11098. [2018-12-03 15:20:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11098 states. [2018-12-03 15:20:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11098 states to 11098 states and 26149 transitions. [2018-12-03 15:20:00,896 INFO L78 Accepts]: Start accepts. Automaton has 11098 states and 26149 transitions. Word has length 24 [2018-12-03 15:20:00,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:00,896 INFO L480 AbstractCegarLoop]: Abstraction has 11098 states and 26149 transitions. [2018-12-03 15:20:00,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:20:00,896 INFO L276 IsEmpty]: Start isEmpty. Operand 11098 states and 26149 transitions. [2018-12-03 15:20:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:20:00,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:00,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:20:00,900 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:00,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:00,900 INFO L82 PathProgramCache]: Analyzing trace with hash -440997654, now seen corresponding path program 1 times [2018-12-03 15:20:00,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:00,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:00,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:00,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:00,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:01,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:20:01,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:01,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:01,019 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:20:01,019 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [94], [102], [104], [110], [113], [115], [120], [126], [179], [183], [203], [217], [229], [260], [264], [274], [292], [298], [310], [349] [2018-12-03 15:20:01,021 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:20:01,021 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:20:01,042 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:20:01,043 INFO L272 AbstractInterpreter]: Visited 24 different actions 65 times. Merged at 17 different actions 30 times. Widened at 2 different actions 2 times. Found 15 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 15:20:01,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:01,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:20:01,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:01,056 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:01,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:01,074 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:20:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:01,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:20:01,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:20:01,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:01,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2018-12-03 15:20:01,365 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:01,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:20:01,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:20:01,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:20:01,366 INFO L87 Difference]: Start difference. First operand 11098 states and 26149 transitions. Second operand 19 states. [2018-12-03 15:20:32,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:32,788 INFO L93 Difference]: Finished difference Result 25128 states and 58685 transitions. [2018-12-03 15:20:32,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:20:32,788 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 15:20:32,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:32,807 INFO L225 Difference]: With dead ends: 25128 [2018-12-03 15:20:32,807 INFO L226 Difference]: Without dead ends: 14031 [2018-12-03 15:20:32,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=616, Invalid=4214, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:20:32,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14031 states. [2018-12-03 15:20:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14031 to 11149. [2018-12-03 15:20:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11149 states. [2018-12-03 15:20:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11149 states to 11149 states and 26230 transitions. [2018-12-03 15:20:51,437 INFO L78 Accepts]: Start accepts. Automaton has 11149 states and 26230 transitions. Word has length 24 [2018-12-03 15:20:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:51,437 INFO L480 AbstractCegarLoop]: Abstraction has 11149 states and 26230 transitions. [2018-12-03 15:20:51,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:20:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 11149 states and 26230 transitions. [2018-12-03 15:20:51,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:20:51,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:51,440 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:20:51,441 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:51,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:51,441 INFO L82 PathProgramCache]: Analyzing trace with hash 556057282, now seen corresponding path program 1 times [2018-12-03 15:20:51,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:51,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:51,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:51,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:51,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:20:51,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:51,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:51,559 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:20:51,560 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [88], [92], [113], [120], [126], [179], [203], [217], [236], [245], [254], [260], [264], [274], [298], [300], [310], [349] [2018-12-03 15:20:51,560 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:20:51,560 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:20:51,580 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:20:51,580 INFO L272 AbstractInterpreter]: Visited 22 different actions 59 times. Merged at 16 different actions 28 times. Widened at 3 different actions 3 times. Found 12 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 15:20:51,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:51,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:20:51,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:51,595 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:51,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:51,603 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:20:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:51,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:51,742 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 15:20:51,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:20:51,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:51,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2018-12-03 15:20:51,916 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:51,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:20:51,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:20:51,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:20:51,917 INFO L87 Difference]: Start difference. First operand 11149 states and 26230 transitions. Second operand 19 states. [2018-12-03 15:21:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:27,078 INFO L93 Difference]: Finished difference Result 27547 states and 64697 transitions. [2018-12-03 15:21:27,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:21:27,078 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 15:21:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:27,098 INFO L225 Difference]: With dead ends: 27547 [2018-12-03 15:21:27,099 INFO L226 Difference]: Without dead ends: 16399 [2018-12-03 15:21:27,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=567, Invalid=3723, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:21:27,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16399 states. [2018-12-03 15:21:45,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16399 to 11168. [2018-12-03 15:21:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11168 states. [2018-12-03 15:21:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11168 states to 11168 states and 26273 transitions. [2018-12-03 15:21:45,962 INFO L78 Accepts]: Start accepts. Automaton has 11168 states and 26273 transitions. Word has length 24 [2018-12-03 15:21:45,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:45,962 INFO L480 AbstractCegarLoop]: Abstraction has 11168 states and 26273 transitions. [2018-12-03 15:21:45,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:21:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 11168 states and 26273 transitions. [2018-12-03 15:21:45,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:21:45,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:45,965 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:21:45,966 INFO L423 AbstractCegarLoop]: === Iteration 72 === [productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:45,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:45,966 INFO L82 PathProgramCache]: Analyzing trace with hash -143603937, now seen corresponding path program 1 times [2018-12-03 15:21:45,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:45,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:45,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:45,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:45,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:21:46,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:46,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:46,101 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:21:46,101 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [92], [94], [98], [122], [132], [199], [203], [207], [224], [236], [245], [247], [252], [254], [349] [2018-12-03 15:21:46,102 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:21:46,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:21:46,111 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:21:46,111 INFO L272 AbstractInterpreter]: Visited 21 different actions 37 times. Merged at 9 different actions 12 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 15:21:46,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:46,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:21:46,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:46,121 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:46,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:46,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:46,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:46,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:46,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:46,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2018-12-03 15:21:46,365 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:46,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:21:46,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:21:46,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:21:46,365 INFO L87 Difference]: Start difference. First operand 11168 states and 26273 transitions. Second operand 19 states.