java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:11:27,694 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:11:27,696 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:11:27,712 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:11:27,713 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:11:27,714 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:11:27,715 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:11:27,718 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:11:27,720 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:11:27,721 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:11:27,729 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:11:27,729 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:11:27,730 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:11:27,735 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:11:27,736 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:11:27,737 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:11:27,739 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:11:27,743 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:11:27,747 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:11:27,748 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:11:27,749 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:11:27,753 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:11:27,757 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:11:27,757 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:11:27,757 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:11:27,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:11:27,760 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:11:27,765 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:11:27,766 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:11:27,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:11:27,769 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:11:27,769 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:11:27,771 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:11:27,771 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:11:27,772 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:11:27,772 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:11:27,773 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:11:27,799 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:11:27,799 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:11:27,802 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:11:27,802 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:11:27,803 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:11:27,803 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:11:27,803 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:11:27,803 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:11:27,803 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:11:27,803 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:11:27,804 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:11:27,804 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:11:27,804 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:11:27,804 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:11:27,804 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:11:27,807 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:11:27,807 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:11:27,809 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:11:27,810 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:11:27,810 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:11:27,810 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:11:27,810 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:11:27,810 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:11:27,810 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:11:27,811 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:11:27,811 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:11:27,811 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:11:27,811 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:11:27,812 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:11:27,812 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:11:27,812 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:11:27,812 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:11:27,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:11:27,815 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:11:27,816 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:11:27,816 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:11:27,816 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:11:27,816 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:11:27,816 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:11:27,817 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:11:27,817 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:11:27,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:11:27,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:11:27,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:11:27,871 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:11:27,871 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:11:27,872 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 16:11:27,872 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-12-03 16:11:27,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:11:27,936 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:11:27,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:27,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:11:27,937 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:11:27,956 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 04:11:27" (1/1) ... [2018-12-03 16:11:27,969 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 04:11:27" (1/1) ... [2018-12-03 16:11:27,975 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:11:27,976 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:11:27,976 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:11:27,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:27,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:11:27,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:11:27,979 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:11:27,995 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 04:11:27" (1/1) ... [2018-12-03 16:11:27,995 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 04:11:27" (1/1) ... [2018-12-03 16:11:27,998 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 04:11:27" (1/1) ... [2018-12-03 16:11:27,998 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 04:11:27" (1/1) ... [2018-12-03 16:11:28,020 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 04:11:27" (1/1) ... [2018-12-03 16:11:28,034 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 04:11:27" (1/1) ... [2018-12-03 16:11:28,039 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 04:11:27" (1/1) ... [2018-12-03 16:11:28,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:11:28,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:11:28,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:11:28,050 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:11:28,051 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 04:11:27" (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 16:11:28,122 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 16:11:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 16:11:28,122 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 16:11:28,973 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:11:28,973 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:11:28,974 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:28 BoogieIcfgContainer [2018-12-03 16:11:28,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:11:28,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:11:28,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:11:28,979 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:11:28,979 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 04:11:27" (1/2) ... [2018-12-03 16:11:28,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79abedb6 and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:11:28, skipping insertion in model container [2018-12-03 16:11:28,980 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 04:11:28" (2/2) ... [2018-12-03 16:11:28,982 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-12-03 16:11:28,991 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:11:29,000 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-12-03 16:11:29,016 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-12-03 16:11:29,052 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:11:29,052 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:11:29,052 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:11:29,053 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:11:29,053 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:11:29,053 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:11:29,053 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:11:29,053 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:11:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-12-03 16:11:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:11:29,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:29,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:29,084 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:29,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:29,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-12-03 16:11:29,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:29,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:29,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:29,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:29,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:29,390 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 16:11:29,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:29,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:11:29,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:29,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:11:29,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:11:29,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:11:29,414 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-12-03 16:11:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:31,247 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-12-03 16:11:31,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:11:31,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 16:11:31,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:31,266 INFO L225 Difference]: With dead ends: 163 [2018-12-03 16:11:31,267 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 16:11:31,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:11:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 16:11:31,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-12-03 16:11:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 16:11:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-12-03 16:11:31,333 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-12-03 16:11:31,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:31,334 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-12-03 16:11:31,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:11:31,334 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-12-03 16:11:31,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:11:31,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:31,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:31,337 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:31,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:31,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-12-03 16:11:31,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:31,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:31,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:31,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:31,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:31,434 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 16:11:31,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:31,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:11:31,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:31,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:11:31,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:11:31,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:11:31,438 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-12-03 16:11:32,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:32,331 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-12-03 16:11:32,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:11:32,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 16:11:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:32,337 INFO L225 Difference]: With dead ends: 188 [2018-12-03 16:11:32,338 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 16:11:32,339 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 16:11:32,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 16:11:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-12-03 16:11:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 16:11:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-12-03 16:11:32,364 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-12-03 16:11:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:32,364 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-12-03 16:11:32,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:11:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-12-03 16:11:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:11:32,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:32,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:32,367 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:32,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:32,367 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-12-03 16:11:32,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:32,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:32,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:32,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:32,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:32,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:32,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:11:32,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:32,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:11:32,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:11:32,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:11:32,465 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-12-03 16:11:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:33,882 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-12-03 16:11:33,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:11:33,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 16:11:33,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:33,889 INFO L225 Difference]: With dead ends: 283 [2018-12-03 16:11:33,889 INFO L226 Difference]: Without dead ends: 278 [2018-12-03 16:11:33,890 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 16:11:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-03 16:11:33,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-12-03 16:11:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 16:11:33,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-12-03 16:11:33,928 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-12-03 16:11:33,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:33,929 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-12-03 16:11:33,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:11:33,929 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-12-03 16:11:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:11:33,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:33,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:33,932 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:33,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:33,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-12-03 16:11:33,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:33,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:33,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:33,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:33,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:34,099 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 16:11:34,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:34,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:11:34,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:34,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:11:34,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:11:34,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:11:34,102 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-12-03 16:11:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:35,932 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-12-03 16:11:35,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:11:35,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 16:11:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:35,937 INFO L225 Difference]: With dead ends: 387 [2018-12-03 16:11:35,937 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 16:11:35,938 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 16:11:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 16:11:35,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-12-03 16:11:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 16:11:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-12-03 16:11:35,980 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-12-03 16:11:35,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:35,980 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-12-03 16:11:35,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:11:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-12-03 16:11:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:35,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:35,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:35,983 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:35,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:35,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-12-03 16:11:35,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:35,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:35,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:35,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:35,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:36,112 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 16:11:36,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:36,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:36,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:36,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:11:36,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:11:36,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:11:36,115 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-12-03 16:11:37,512 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 16:11:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:39,593 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-12-03 16:11:39,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:11:39,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:11:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:39,599 INFO L225 Difference]: With dead ends: 725 [2018-12-03 16:11:39,600 INFO L226 Difference]: Without dead ends: 717 [2018-12-03 16:11:39,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:11:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-12-03 16:11:39,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-12-03 16:11:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-03 16:11:39,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-12-03 16:11:39,666 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-12-03 16:11:39,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:39,667 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-12-03 16:11:39,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:11:39,667 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-12-03 16:11:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:39,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:39,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:39,669 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:39,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:39,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-12-03 16:11:39,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:39,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:39,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:39,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:39,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:39,793 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 16:11:39,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:39,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:39,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:39,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:11:39,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:11:39,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:11:39,795 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-12-03 16:11:42,457 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 16:11:43,420 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 16:11:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:45,932 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-12-03 16:11:45,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:11:45,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:11:45,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:45,941 INFO L225 Difference]: With dead ends: 1008 [2018-12-03 16:11:45,941 INFO L226 Difference]: Without dead ends: 1000 [2018-12-03 16:11:45,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:11:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-12-03 16:11:46,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-12-03 16:11:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-03 16:11:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-12-03 16:11:46,010 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-12-03 16:11:46,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:46,010 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-12-03 16:11:46,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:11:46,010 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-12-03 16:11:46,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:46,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:46,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:46,012 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:46,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:46,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-12-03 16:11:46,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:46,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:46,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:46,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:46,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:46,138 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 16:11:46,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:46,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:46,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:46,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:11:46,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:11:46,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:11:46,140 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-12-03 16:11:48,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:48,615 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-12-03 16:11:48,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:11:48,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:11:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:48,624 INFO L225 Difference]: With dead ends: 924 [2018-12-03 16:11:48,624 INFO L226 Difference]: Without dead ends: 916 [2018-12-03 16:11:48,626 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 16:11:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-12-03 16:11:48,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-12-03 16:11:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-12-03 16:11:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-12-03 16:11:48,706 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-12-03 16:11:48,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:48,707 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-12-03 16:11:48,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:11:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-12-03 16:11:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:48,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:48,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:48,708 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:48,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:48,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-12-03 16:11:48,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:48,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:48,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:48,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:48,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:48,787 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 16:11:48,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:48,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:48,787 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:48,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:11:48,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:11:48,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:11:48,789 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-12-03 16:11:50,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:50,724 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-12-03 16:11:50,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:11:50,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:11:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:50,731 INFO L225 Difference]: With dead ends: 791 [2018-12-03 16:11:50,731 INFO L226 Difference]: Without dead ends: 783 [2018-12-03 16:11:50,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:11:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-03 16:11:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-12-03 16:11:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-12-03 16:11:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-12-03 16:11:50,830 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-12-03 16:11:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:50,831 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-12-03 16:11:50,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:11:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-12-03 16:11:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:50,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:50,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:50,833 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:50,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:50,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-12-03 16:11:50,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:50,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:50,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:50,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:50,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:50,943 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 16:11:50,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:50,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:50,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:50,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:11:50,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:11:50,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:11:50,944 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-12-03 16:11:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:53,129 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-12-03 16:11:53,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:11:53,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:11:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:53,136 INFO L225 Difference]: With dead ends: 1040 [2018-12-03 16:11:53,136 INFO L226 Difference]: Without dead ends: 1032 [2018-12-03 16:11:53,137 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 16:11:53,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-12-03 16:11:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-12-03 16:11:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-12-03 16:11:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-12-03 16:11:53,257 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-12-03 16:11:53,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:53,258 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-12-03 16:11:53,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:11:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-12-03 16:11:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:53,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:53,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:53,259 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:53,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:53,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-12-03 16:11:53,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:53,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:53,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:53,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:53,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:53,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 16:11:53,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:53,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:53,356 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:53,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:11:53,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:11:53,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:11:53,358 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-12-03 16:11:56,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:56,132 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-12-03 16:11:56,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:11:56,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:11:56,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:56,140 INFO L225 Difference]: With dead ends: 1166 [2018-12-03 16:11:56,140 INFO L226 Difference]: Without dead ends: 1158 [2018-12-03 16:11:56,142 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 16:11:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-12-03 16:11:56,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-12-03 16:11:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-12-03 16:11:56,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-12-03 16:11:56,279 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-12-03 16:11:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:56,280 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-12-03 16:11:56,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:11:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-12-03 16:11:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:56,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:56,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:56,282 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:56,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:56,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-12-03 16:11:56,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:56,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:56,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:56,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:56,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:56,401 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 16:11:56,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:56,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:56,402 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:56,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:11:56,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:11:56,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:11:56,403 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-12-03 16:11:58,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:58,964 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-12-03 16:11:58,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:11:58,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:11:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:58,971 INFO L225 Difference]: With dead ends: 1127 [2018-12-03 16:11:58,971 INFO L226 Difference]: Without dead ends: 1119 [2018-12-03 16:11:58,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:11:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-12-03 16:11:59,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-12-03 16:11:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-12-03 16:11:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-12-03 16:11:59,199 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-12-03 16:11:59,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:59,199 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-12-03 16:11:59,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:11:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-12-03 16:11:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:59,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:59,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:59,201 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:59,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:59,202 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-12-03 16:11:59,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:59,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:59,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:59,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:59,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:59,393 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 16:11:59,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:59,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:59,393 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:59,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:11:59,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:11:59,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:11:59,394 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-12-03 16:12:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:01,843 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-12-03 16:12:01,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:12:01,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:12:01,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:01,849 INFO L225 Difference]: With dead ends: 975 [2018-12-03 16:12:01,849 INFO L226 Difference]: Without dead ends: 967 [2018-12-03 16:12:01,851 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 16:12:01,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-12-03 16:12:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-12-03 16:12:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-03 16:12:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-12-03 16:12:02,004 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-12-03 16:12:02,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:02,006 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-12-03 16:12:02,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:12:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-12-03 16:12:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:02,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:02,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:02,008 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:02,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:02,008 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-12-03 16:12:02,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:02,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:02,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:02,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:02,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:02,129 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 16:12:02,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:02,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:02,130 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:02,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:12:02,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:12:02,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:12:02,131 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-12-03 16:12:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:04,739 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-12-03 16:12:04,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:12:04,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:12:04,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:04,743 INFO L225 Difference]: With dead ends: 1011 [2018-12-03 16:12:04,743 INFO L226 Difference]: Without dead ends: 1003 [2018-12-03 16:12:04,744 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 16:12:04,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-12-03 16:12:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-12-03 16:12:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-12-03 16:12:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-12-03 16:12:04,909 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-12-03 16:12:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:04,910 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-12-03 16:12:04,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:12:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-12-03 16:12:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:04,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:04,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:04,911 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:04,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:04,912 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-12-03 16:12:04,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:04,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:04,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:04,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:04,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:04,997 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 16:12:04,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:04,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:04,998 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:04,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:12:04,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:12:04,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:12:04,999 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-12-03 16:12:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:07,193 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-12-03 16:12:07,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:12:07,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:12:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:07,202 INFO L225 Difference]: With dead ends: 859 [2018-12-03 16:12:07,202 INFO L226 Difference]: Without dead ends: 851 [2018-12-03 16:12:07,203 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 16:12:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-12-03 16:12:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-12-03 16:12:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-12-03 16:12:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-12-03 16:12:07,396 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-12-03 16:12:07,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:07,396 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-12-03 16:12:07,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:12:07,396 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-12-03 16:12:07,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:07,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:07,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:07,397 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:07,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:07,398 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-12-03 16:12:07,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:07,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:07,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:07,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:07,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:07,476 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 16:12:07,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:07,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:07,477 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:07,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:07,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:07,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:07,478 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-12-03 16:12:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:09,707 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-12-03 16:12:09,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:12:09,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:12:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:09,713 INFO L225 Difference]: With dead ends: 962 [2018-12-03 16:12:09,714 INFO L226 Difference]: Without dead ends: 954 [2018-12-03 16:12:09,714 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 16:12:09,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-12-03 16:12:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-12-03 16:12:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-12-03 16:12:09,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-12-03 16:12:09,958 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-12-03 16:12:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:09,958 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-12-03 16:12:09,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-12-03 16:12:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:09,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:09,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:09,961 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:09,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:09,961 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-12-03 16:12:09,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:09,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:09,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:09,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:09,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:10,042 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 16:12:10,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:10,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:10,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:10,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:10,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:10,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:10,044 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-12-03 16:12:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:12,799 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-12-03 16:12:12,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:12:12,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:12:12,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:12,805 INFO L225 Difference]: With dead ends: 1064 [2018-12-03 16:12:12,805 INFO L226 Difference]: Without dead ends: 1056 [2018-12-03 16:12:12,806 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 16:12:12,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-12-03 16:12:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-12-03 16:12:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-12-03 16:12:13,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-12-03 16:12:13,134 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-12-03 16:12:13,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:13,134 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-12-03 16:12:13,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-12-03 16:12:13,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:13,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:13,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:13,136 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:13,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:13,136 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-12-03 16:12:13,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:13,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:13,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:13,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:13,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:13,216 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 16:12:13,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:13,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:13,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:13,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:13,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:13,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:13,217 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-12-03 16:12:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:16,493 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-12-03 16:12:16,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:12:16,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:12:16,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:16,499 INFO L225 Difference]: With dead ends: 1241 [2018-12-03 16:12:16,499 INFO L226 Difference]: Without dead ends: 1233 [2018-12-03 16:12:16,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:12:16,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-12-03 16:12:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-12-03 16:12:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-12-03 16:12:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-12-03 16:12:16,867 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-12-03 16:12:16,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:16,867 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-12-03 16:12:16,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-12-03 16:12:16,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:16,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:16,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:16,869 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:16,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:16,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-12-03 16:12:16,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:16,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:16,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:16,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:16,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:16,945 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 16:12:16,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:16,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:16,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:16,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:16,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:16,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:16,948 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-12-03 16:12:19,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:19,354 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-12-03 16:12:19,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:12:19,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:12:19,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:19,360 INFO L225 Difference]: With dead ends: 1139 [2018-12-03 16:12:19,361 INFO L226 Difference]: Without dead ends: 1131 [2018-12-03 16:12:19,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:12:19,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-12-03 16:12:19,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-12-03 16:12:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-12-03 16:12:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-12-03 16:12:19,671 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-12-03 16:12:19,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:19,671 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-12-03 16:12:19,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-12-03 16:12:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:19,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:19,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:19,674 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:19,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:19,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-12-03 16:12:19,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:19,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:19,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:19,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:19,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:19,752 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 16:12:19,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:19,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:19,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:19,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:19,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:19,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:19,754 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-12-03 16:12:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:22,858 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-12-03 16:12:22,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:12:22,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:12:22,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:22,864 INFO L225 Difference]: With dead ends: 1325 [2018-12-03 16:12:22,864 INFO L226 Difference]: Without dead ends: 1317 [2018-12-03 16:12:22,865 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 16:12:22,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-12-03 16:12:23,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-12-03 16:12:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-12-03 16:12:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-12-03 16:12:23,198 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-12-03 16:12:23,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:23,198 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-12-03 16:12:23,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-12-03 16:12:23,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:23,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:23,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:23,200 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:23,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:23,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-12-03 16:12:23,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:23,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:23,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:23,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:23,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:23,274 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 16:12:23,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:23,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:23,275 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:23,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:23,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:23,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:23,277 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-12-03 16:12:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:26,737 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-12-03 16:12:26,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:12:26,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:12:26,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:26,743 INFO L225 Difference]: With dead ends: 1334 [2018-12-03 16:12:26,743 INFO L226 Difference]: Without dead ends: 1326 [2018-12-03 16:12:26,744 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 16:12:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-12-03 16:12:27,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-12-03 16:12:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-12-03 16:12:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-12-03 16:12:27,086 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-12-03 16:12:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:27,087 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-12-03 16:12:27,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-12-03 16:12:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:27,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:27,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:27,088 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:27,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:27,088 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-12-03 16:12:27,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:27,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:27,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:27,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:27,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:27,156 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 16:12:27,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:27,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:27,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:27,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:27,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:27,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:27,157 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-12-03 16:12:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:29,156 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-12-03 16:12:29,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:12:29,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:12:29,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:29,161 INFO L225 Difference]: With dead ends: 919 [2018-12-03 16:12:29,161 INFO L226 Difference]: Without dead ends: 911 [2018-12-03 16:12:29,162 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 16:12:29,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-12-03 16:12:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-12-03 16:12:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-12-03 16:12:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-12-03 16:12:29,554 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-12-03 16:12:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:29,555 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-12-03 16:12:29,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-12-03 16:12:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:29,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:29,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:29,556 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:29,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:29,556 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-12-03 16:12:29,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:29,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:29,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:29,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:29,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:29,625 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 16:12:29,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:29,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:29,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:29,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:29,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:29,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:29,626 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-12-03 16:12:32,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:32,353 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-12-03 16:12:32,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:12:32,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:12:32,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:32,360 INFO L225 Difference]: With dead ends: 1095 [2018-12-03 16:12:32,360 INFO L226 Difference]: Without dead ends: 1087 [2018-12-03 16:12:32,361 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 16:12:32,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-12-03 16:12:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-12-03 16:12:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-12-03 16:12:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-12-03 16:12:32,736 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-12-03 16:12:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:32,736 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-12-03 16:12:32,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-12-03 16:12:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:32,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:32,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:32,737 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:32,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:32,737 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-12-03 16:12:32,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:32,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:32,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:32,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:32,808 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 16:12:32,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:32,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:32,808 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:32,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:32,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:32,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:32,809 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-12-03 16:12:36,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:36,716 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-12-03 16:12:36,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:12:36,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:12:36,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:36,719 INFO L225 Difference]: With dead ends: 1304 [2018-12-03 16:12:36,720 INFO L226 Difference]: Without dead ends: 1296 [2018-12-03 16:12:36,720 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 16:12:36,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-12-03 16:12:37,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-12-03 16:12:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-03 16:12:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-12-03 16:12:37,075 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-12-03 16:12:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:37,076 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-12-03 16:12:37,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-12-03 16:12:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:37,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:37,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:37,077 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:37,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:37,078 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-12-03 16:12:37,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:37,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:37,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:37,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:37,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:37,147 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 16:12:37,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:37,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:37,148 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:37,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:37,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:37,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:37,149 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-12-03 16:12:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:40,453 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-12-03 16:12:40,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:12:40,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:12:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:40,455 INFO L225 Difference]: With dead ends: 1192 [2018-12-03 16:12:40,456 INFO L226 Difference]: Without dead ends: 1184 [2018-12-03 16:12:40,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:12:40,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-12-03 16:12:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-12-03 16:12:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-12-03 16:12:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-12-03 16:12:40,963 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-12-03 16:12:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:40,964 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-12-03 16:12:40,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-12-03 16:12:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:12:40,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:40,965 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:40,965 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:40,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:40,965 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-12-03 16:12:40,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:40,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:40,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:41,029 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 16:12:41,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:41,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:12:41,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:41,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:12:41,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:12:41,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:12:41,031 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-12-03 16:12:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:41,846 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-12-03 16:12:41,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:12:41,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 16:12:41,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:41,847 INFO L225 Difference]: With dead ends: 1139 [2018-12-03 16:12:41,847 INFO L226 Difference]: Without dead ends: 625 [2018-12-03 16:12:41,850 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 16:12:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-12-03 16:12:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-12-03 16:12:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-12-03 16:12:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-12-03 16:12:42,347 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-12-03 16:12:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:42,347 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-12-03 16:12:42,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:12:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-12-03 16:12:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:12:42,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:42,348 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:42,348 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:42,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:42,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-12-03 16:12:42,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:42,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:42,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:42,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:42,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:42,484 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 16:12:42,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:42,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:42,485 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 16:12:42,487 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [92], [132], [251], [252], [337], [345], [351] [2018-12-03 16:12:42,523 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:42,524 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:42,738 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:42,740 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 16:12:42,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:42,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:42,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:42,753 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 16:12:42,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:42,764 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:42,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:44,189 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 16:12:44,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:44,523 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 16:12:44,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:44,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2018-12-03 16:12:44,546 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:44,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:12:44,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:12:44,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:12:44,547 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-12-03 16:12:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:48,027 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-12-03 16:12:48,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:12:48,032 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-12-03 16:12:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:48,034 INFO L225 Difference]: With dead ends: 794 [2018-12-03 16:12:48,034 INFO L226 Difference]: Without dead ends: 789 [2018-12-03 16:12:48,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:12:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-12-03 16:12:48,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-12-03 16:12:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-12-03 16:12:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-12-03 16:12:48,876 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-12-03 16:12:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:48,876 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-12-03 16:12:48,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:12:48,876 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-12-03 16:12:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:12:48,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:48,877 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:48,877 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:48,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:48,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-12-03 16:12:48,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:48,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:48,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:48,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:48,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:48,941 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 16:12:48,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:48,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:12:48,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:48,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:12:48,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:12:48,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:12:48,942 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-12-03 16:12:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:50,312 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-12-03 16:12:50,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:12:50,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 16:12:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:50,314 INFO L225 Difference]: With dead ends: 1317 [2018-12-03 16:12:50,314 INFO L226 Difference]: Without dead ends: 729 [2018-12-03 16:12:50,316 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 16:12:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-12-03 16:12:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-12-03 16:12:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-12-03 16:12:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-12-03 16:12:51,054 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-12-03 16:12:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:51,054 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-12-03 16:12:51,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:12:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-12-03 16:12:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:12:51,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:51,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:51,056 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:51,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:51,057 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-12-03 16:12:51,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:51,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:51,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:51,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:51,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:51,266 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 16:12:51,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:51,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:51,267 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:51,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:51,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:51,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:51,267 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-12-03 16:12:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:54,695 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-12-03 16:12:54,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:12:54,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:12:54,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:54,699 INFO L225 Difference]: With dead ends: 1435 [2018-12-03 16:12:54,699 INFO L226 Difference]: Without dead ends: 1427 [2018-12-03 16:12:54,700 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 16:12:54,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-12-03 16:12:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-12-03 16:12:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-12-03 16:12:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-12-03 16:12:55,598 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-12-03 16:12:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:55,598 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-12-03 16:12:55,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-12-03 16:12:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:12:55,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:55,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:55,599 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:55,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:55,600 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-12-03 16:12:55,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:55,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:55,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:55,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:55,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:55,812 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 16:12:55,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:55,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:55,812 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:55,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:55,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:55,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:55,813 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-12-03 16:12:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:59,596 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-12-03 16:12:59,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:12:59,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:12:59,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:59,600 INFO L225 Difference]: With dead ends: 1599 [2018-12-03 16:12:59,600 INFO L226 Difference]: Without dead ends: 1591 [2018-12-03 16:12:59,601 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 16:12:59,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-12-03 16:13:00,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-12-03 16:13:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-12-03 16:13:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-12-03 16:13:00,405 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-12-03 16:13:00,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:00,405 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-12-03 16:13:00,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-12-03 16:13:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:00,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:00,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:00,406 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:00,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:00,407 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-12-03 16:13:00,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:00,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:00,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:00,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:00,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:00,477 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 16:13:00,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:00,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:13:00,477 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:00,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:00,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:00,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:00,478 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-12-03 16:13:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:03,742 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-12-03 16:13:03,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:13:03,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:13:03,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:03,746 INFO L225 Difference]: With dead ends: 1411 [2018-12-03 16:13:03,747 INFO L226 Difference]: Without dead ends: 1403 [2018-12-03 16:13:03,747 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 16:13:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-12-03 16:13:04,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-12-03 16:13:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-03 16:13:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-12-03 16:13:04,666 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-12-03 16:13:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:04,666 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-12-03 16:13:04,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-12-03 16:13:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:04,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:04,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:04,668 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:04,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:04,668 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-12-03 16:13:04,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:04,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:04,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:04,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:04,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:04,785 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 16:13:04,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:04,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:13:04,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:04,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:04,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:04,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:04,786 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-12-03 16:13:08,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:08,341 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-12-03 16:13:08,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:13:08,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:13:08,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:08,346 INFO L225 Difference]: With dead ends: 1490 [2018-12-03 16:13:08,347 INFO L226 Difference]: Without dead ends: 1482 [2018-12-03 16:13:08,348 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 16:13:08,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-12-03 16:13:09,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-12-03 16:13:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-12-03 16:13:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-12-03 16:13:09,351 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-12-03 16:13:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:09,351 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-12-03 16:13:09,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-12-03 16:13:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:09,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:09,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:09,352 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:09,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:09,352 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-12-03 16:13:09,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:09,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:09,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:09,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:09,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:09,479 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 16:13:09,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:09,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:13:09,480 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:09,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:09,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:09,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:09,480 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-12-03 16:13:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:12,807 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-12-03 16:13:12,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:13:12,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:13:12,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:12,809 INFO L225 Difference]: With dead ends: 1427 [2018-12-03 16:13:12,809 INFO L226 Difference]: Without dead ends: 1419 [2018-12-03 16:13:12,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:13:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-12-03 16:13:13,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-12-03 16:13:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-12-03 16:13:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-12-03 16:13:13,699 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-12-03 16:13:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:13,699 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-12-03 16:13:13,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-12-03 16:13:13,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:13,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:13,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:13,701 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:13,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:13,701 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-12-03 16:13:13,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:13,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:13,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:13,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:13,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:14,263 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 16:13:14,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:14,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:13:14,264 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:14,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:14,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:14,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:14,265 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-12-03 16:13:17,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:17,609 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-12-03 16:13:17,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:13:17,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:13:17,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:17,612 INFO L225 Difference]: With dead ends: 1306 [2018-12-03 16:13:17,612 INFO L226 Difference]: Without dead ends: 1298 [2018-12-03 16:13:17,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:13:17,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-12-03 16:13:18,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-12-03 16:13:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-12-03 16:13:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-12-03 16:13:18,588 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-12-03 16:13:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:18,588 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-12-03 16:13:18,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-12-03 16:13:18,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:18,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:18,589 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:18,590 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:18,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:18,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-12-03 16:13:18,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:18,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:18,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:18,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:18,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:18,665 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 16:13:18,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:18,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:18,666 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:13:18,666 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [113], [120], [122], [126], [203], [236], [245], [254], [260], [274], [349] [2018-12-03 16:13:18,667 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:18,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:18,681 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:18,682 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 16:13:18,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:18,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:18,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:18,688 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 16:13:18,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:18,697 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:18,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:18,707 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 16:13:18,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:18,711 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 16:13:18,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:18,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:13:18,730 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:18,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:18,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:18,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:18,731 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-12-03 16:13:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:21,677 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-12-03 16:13:21,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:13:21,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:13:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:21,679 INFO L225 Difference]: With dead ends: 1285 [2018-12-03 16:13:21,679 INFO L226 Difference]: Without dead ends: 1277 [2018-12-03 16:13:21,680 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 16:13:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-12-03 16:13:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-12-03 16:13:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-12-03 16:13:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-12-03 16:13:22,720 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-12-03 16:13:22,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:22,720 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-12-03 16:13:22,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-12-03 16:13:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:22,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:22,721 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:22,721 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:22,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:22,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-12-03 16:13:22,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:22,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:22,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:22,793 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 16:13:22,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:22,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:22,794 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:13:22,794 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [92], [113], [115], [120], [126], [203], [236], [245], [254], [260], [274], [349] [2018-12-03 16:13:22,795 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:22,795 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:22,815 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:22,815 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 16:13:22,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:22,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:22,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:22,841 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 16:13:22,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:22,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:22,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:22,861 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 16:13:22,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:22,864 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 16:13:22,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:22,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:13:22,883 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:22,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:22,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:22,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:22,884 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-12-03 16:13:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:26,537 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-12-03 16:13:26,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:13:26,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:13:26,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:26,540 INFO L225 Difference]: With dead ends: 1518 [2018-12-03 16:13:26,540 INFO L226 Difference]: Without dead ends: 1510 [2018-12-03 16:13:26,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:13:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-12-03 16:13:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-12-03 16:13:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-12-03 16:13:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-12-03 16:13:27,547 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-12-03 16:13:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:27,547 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-12-03 16:13:27,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-12-03 16:13:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:27,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:27,548 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:27,548 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:27,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-12-03 16:13:27,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:27,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:27,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:27,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:27,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:27,617 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 16:13:27,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:27,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:27,617 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:13:27,618 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [98], [113], [115], [120], [126], [203], [236], [245], [260], [274], [349] [2018-12-03 16:13:27,619 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:27,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:27,636 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:27,636 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 16:13:27,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:27,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:27,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:27,645 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 16:13:27,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:27,656 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:27,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:27,672 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 16:13:27,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:27,676 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 16:13:27,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:27,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:13:27,695 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:27,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:27,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:27,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:27,696 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-12-03 16:13:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:31,338 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-12-03 16:13:31,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:13:31,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:13:31,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:31,340 INFO L225 Difference]: With dead ends: 1448 [2018-12-03 16:13:31,340 INFO L226 Difference]: Without dead ends: 1440 [2018-12-03 16:13:31,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:13:31,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-12-03 16:13:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-12-03 16:13:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-12-03 16:13:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-12-03 16:13:32,457 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-12-03 16:13:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:32,457 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-12-03 16:13:32,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-12-03 16:13:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:32,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:32,458 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:32,458 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:32,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:32,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-12-03 16:13:32,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:32,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:32,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:32,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:32,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:32,566 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 16:13:32,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:32,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:32,567 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:13:32,567 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [102], [113], [115], [120], [126], [183], [203], [229], [260], [274], [349] [2018-12-03 16:13:32,568 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:32,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:32,587 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:32,587 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 16:13:32,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:32,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:32,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:32,597 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 16:13:32,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:32,605 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:32,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:32,616 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 16:13:32,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:32,619 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 16:13:32,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:32,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:13:32,641 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:32,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:32,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:32,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:32,642 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-12-03 16:13:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:35,661 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-12-03 16:13:35,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:13:35,662 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:13:35,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:35,663 INFO L225 Difference]: With dead ends: 1254 [2018-12-03 16:13:35,664 INFO L226 Difference]: Without dead ends: 1246 [2018-12-03 16:13:35,664 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 16:13:35,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-12-03 16:13:36,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-12-03 16:13:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-12-03 16:13:36,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-12-03 16:13:36,617 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-12-03 16:13:36,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:36,618 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-12-03 16:13:36,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-12-03 16:13:36,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:36,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:36,619 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:36,619 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:36,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:36,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-12-03 16:13:36,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:36,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:36,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:36,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:36,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:36,710 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 16:13:36,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:36,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:36,711 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:13:36,711 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [92], [132], [203], [236], [245], [252], [254], [337], [345], [351] [2018-12-03 16:13:36,712 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:36,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:36,724 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:36,724 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 16:13:36,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:36,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:36,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:36,732 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 16:13:36,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:36,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:36,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:37,042 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 16:13:37,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:37,192 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 16:13:37,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:37,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2018-12-03 16:13:37,212 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:37,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:13:37,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:13:37,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:13:37,213 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 17 states. [2018-12-03 16:13:38,972 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-03 16:13:43,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:43,167 INFO L93 Difference]: Finished difference Result 1278 states and 2792 transitions. [2018-12-03 16:13:43,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:13:43,167 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 16:13:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:43,169 INFO L225 Difference]: With dead ends: 1278 [2018-12-03 16:13:43,169 INFO L226 Difference]: Without dead ends: 1270 [2018-12-03 16:13:43,170 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 16:13:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-12-03 16:13:44,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 970. [2018-12-03 16:13:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-12-03 16:13:44,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-12-03 16:13:44,305 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-12-03 16:13:44,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:44,305 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-12-03 16:13:44,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:13:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-12-03 16:13:44,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:44,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:44,306 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:44,306 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:44,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:44,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-12-03 16:13:44,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:44,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:44,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:44,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:44,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:44,413 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 16:13:44,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:44,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 16:13:44,413 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:44,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:13:44,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:13:44,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:13:44,414 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-12-03 16:13:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:47,753 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-12-03 16:13:47,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:13:47,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 16:13:47,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:47,755 INFO L225 Difference]: With dead ends: 1180 [2018-12-03 16:13:47,755 INFO L226 Difference]: Without dead ends: 1172 [2018-12-03 16:13:47,756 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 16:13:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-12-03 16:13:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-12-03 16:13:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-12-03 16:13:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-12-03 16:13:48,788 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-12-03 16:13:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:48,788 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-12-03 16:13:48,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:13:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-12-03 16:13:48,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:48,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:48,789 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:48,789 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:48,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:48,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-12-03 16:13:48,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:48,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:48,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:48,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:48,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:49,169 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 16:13:49,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:49,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 16:13:49,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:49,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:13:49,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:13:49,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:13:49,171 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-12-03 16:13:52,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:52,868 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-12-03 16:13:52,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:13:52,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 16:13:52,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:52,870 INFO L225 Difference]: With dead ends: 1233 [2018-12-03 16:13:52,871 INFO L226 Difference]: Without dead ends: 1225 [2018-12-03 16:13:52,871 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 16:13:52,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-12-03 16:13:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-12-03 16:13:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-12-03 16:13:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-12-03 16:13:54,023 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-12-03 16:13:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:54,023 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-12-03 16:13:54,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:13:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-12-03 16:13:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:54,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:54,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:54,024 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:54,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:54,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-12-03 16:13:54,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:54,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:54,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:54,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:54,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:54,099 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 16:13:54,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:54,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 16:13:54,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:54,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:13:54,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:13:54,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:13:54,100 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-12-03 16:13:58,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:58,428 INFO L93 Difference]: Finished difference Result 1537 states and 3410 transitions. [2018-12-03 16:13:58,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:13:58,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 16:13:58,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:58,431 INFO L225 Difference]: With dead ends: 1537 [2018-12-03 16:13:58,431 INFO L226 Difference]: Without dead ends: 1529 [2018-12-03 16:13:58,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:13:58,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-12-03 16:13:59,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1013. [2018-12-03 16:13:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-12-03 16:13:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-12-03 16:13:59,638 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-12-03 16:13:59,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:59,638 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-12-03 16:13:59,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:13:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-12-03 16:13:59,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:59,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:59,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:59,639 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:59,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:59,639 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-12-03 16:13:59,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:59,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:59,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:59,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:59,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:59,722 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 16:13:59,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:59,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 16:13:59,722 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:59,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:13:59,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:13:59,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:13:59,723 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-12-03 16:14:04,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:04,334 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-12-03 16:14:04,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:14:04,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 16:14:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:04,337 INFO L225 Difference]: With dead ends: 1590 [2018-12-03 16:14:04,337 INFO L226 Difference]: Without dead ends: 1582 [2018-12-03 16:14:04,338 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 16:14:04,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-12-03 16:14:05,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-12-03 16:14:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-12-03 16:14:05,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-12-03 16:14:05,559 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-12-03 16:14:05,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:05,560 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-12-03 16:14:05,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:14:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-12-03 16:14:05,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:14:05,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:05,560 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:05,561 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:05,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:05,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-12-03 16:14:05,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:05,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:05,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:05,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:05,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:05,628 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 16:14:05,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:05,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:05,629 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:14:05,629 INFO L205 CegarAbsIntRunner]: [0], [4], [59], [78], [159], [174], [183], [203], [204], [279], [283], [337], [345], [351] [2018-12-03 16:14:05,630 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:14:05,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:14:05,650 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:14:05,651 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 16:14:05,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:05,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:14:05,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:05,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:14:05,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:05,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:05,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:05,802 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 16:14:05,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:05,946 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 16:14:05,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:05,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 16:14:05,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:05,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:14:05,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:14:05,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:14:05,966 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 17 states. [2018-12-03 16:14:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:15,430 INFO L93 Difference]: Finished difference Result 1949 states and 4288 transitions. [2018-12-03 16:14:15,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 16:14:15,430 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 16:14:15,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:15,433 INFO L225 Difference]: With dead ends: 1949 [2018-12-03 16:14:15,433 INFO L226 Difference]: Without dead ends: 1941 [2018-12-03 16:14:15,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3051 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1802, Invalid=8704, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 16:14:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-12-03 16:14:16,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1031. [2018-12-03 16:14:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-12-03 16:14:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-12-03 16:14:16,782 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-12-03 16:14:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:16,782 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-12-03 16:14:16,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:14:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-12-03 16:14:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:14:16,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:16,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:16,783 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:16,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-12-03 16:14:16,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:16,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:16,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:16,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:16,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:16,866 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 16:14:16,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:14:16,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 16:14:16,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:14:16,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:14:16,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:14:16,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:14:16,867 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-12-03 16:14:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:21,226 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-12-03 16:14:21,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:14:21,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 16:14:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:21,228 INFO L225 Difference]: With dead ends: 1420 [2018-12-03 16:14:21,228 INFO L226 Difference]: Without dead ends: 1412 [2018-12-03 16:14:21,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:14:21,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-12-03 16:14:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-12-03 16:14:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-12-03 16:14:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-12-03 16:14:22,441 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-12-03 16:14:22,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:22,441 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-12-03 16:14:22,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:14:22,442 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-12-03 16:14:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:14:22,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:22,442 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:22,442 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:22,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:22,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-12-03 16:14:22,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:22,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:22,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:22,515 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 16:14:22,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:22,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:22,516 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:14:22,516 INFO L205 CegarAbsIntRunner]: [0], [4], [159], [174], [183], [203], [204], [279], [283], [321], [331], [339], [345], [351] [2018-12-03 16:14:22,517 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:14:22,517 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:14:22,527 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:14:22,527 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 16:14:22,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:22,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:14:22,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:22,544 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 16:14:22,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:22,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:22,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:22,703 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 16:14:22,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:22,855 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 16:14:22,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:22,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 16:14:22,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:22,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:14:22,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:14:22,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:14:22,875 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 17 states. [2018-12-03 16:14:37,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:37,017 INFO L93 Difference]: Finished difference Result 2767 states and 6075 transitions. [2018-12-03 16:14:37,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-12-03 16:14:37,018 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 16:14:37,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:37,021 INFO L225 Difference]: With dead ends: 2767 [2018-12-03 16:14:37,021 INFO L226 Difference]: Without dead ends: 2759 [2018-12-03 16:14:37,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6171 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2931, Invalid=16251, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 16:14:37,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-12-03 16:14:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1094. [2018-12-03 16:14:38,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-12-03 16:14:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2474 transitions. [2018-12-03 16:14:38,376 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2474 transitions. Word has length 16 [2018-12-03 16:14:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:38,376 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 2474 transitions. [2018-12-03 16:14:38,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:14:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2474 transitions. [2018-12-03 16:14:38,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:14:38,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:38,377 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:38,377 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:38,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:38,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-12-03 16:14:38,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:38,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:38,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:38,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:38,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:38,447 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 16:14:38,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:38,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:38,447 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:14:38,447 INFO L205 CegarAbsIntRunner]: [0], [4], [159], [174], [183], [203], [204], [283], [314], [323], [331], [339], [345], [351] [2018-12-03 16:14:38,448 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:14:38,448 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:14:38,458 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:14:38,458 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 16:14:38,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:38,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:14:38,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:38,477 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 16:14:38,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:38,488 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:38,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:38,605 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 16:14:38,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:39,070 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 16:14:39,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:39,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 16:14:39,090 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:39,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:14:39,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:14:39,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:14:39,091 INFO L87 Difference]: Start difference. First operand 1094 states and 2474 transitions. Second operand 17 states. [2018-12-03 16:14:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:53,082 INFO L93 Difference]: Finished difference Result 2361 states and 5206 transitions. [2018-12-03 16:14:53,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-12-03 16:14:53,082 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 16:14:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:53,085 INFO L225 Difference]: With dead ends: 2361 [2018-12-03 16:14:53,085 INFO L226 Difference]: Without dead ends: 2353 [2018-12-03 16:14:53,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9579 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3721, Invalid=24001, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 16:14:53,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-12-03 16:14:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1155. [2018-12-03 16:14:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-12-03 16:14:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2607 transitions. [2018-12-03 16:14:54,679 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2607 transitions. Word has length 16 [2018-12-03 16:14:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:54,679 INFO L480 AbstractCegarLoop]: Abstraction has 1155 states and 2607 transitions. [2018-12-03 16:14:54,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:14:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2607 transitions. [2018-12-03 16:14:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:14:54,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:54,680 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 16:14:54,680 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:54,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:54,680 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-12-03 16:14:54,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:54,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:54,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:54,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:54,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:54,755 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 16:14:54,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:54,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:54,756 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-12-03 16:14:54,756 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [65], [76], [84], [86], [92], [113], [120], [128], [132], [251], [260], [274], [337], [349] [2018-12-03 16:14:54,757 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:14:54,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:14:54,767 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:14:54,767 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 16:14:54,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:54,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:14:54,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:54,770 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 16:14:54,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:54,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:54,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:54,880 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 16:14:54,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:54,941 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 16:14:54,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:54,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-03 16:14:54,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:54,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:14:54,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:14:54,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:14:54,961 INFO L87 Difference]: Start difference. First operand 1155 states and 2607 transitions. Second operand 14 states. [2018-12-03 16:14:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:57,878 INFO L93 Difference]: Finished difference Result 1507 states and 3367 transitions. [2018-12-03 16:14:57,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:14:57,878 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-12-03 16:14:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:57,880 INFO L225 Difference]: With dead ends: 1507 [2018-12-03 16:14:57,880 INFO L226 Difference]: Without dead ends: 1502 [2018-12-03 16:14:57,881 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 16:14:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-12-03 16:14:59,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2018-12-03 16:14:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2018-12-03 16:14:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2995 transitions. [2018-12-03 16:14:59,791 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2995 transitions. Word has length 17 [2018-12-03 16:14:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:59,791 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2995 transitions. [2018-12-03 16:14:59,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:14:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2995 transitions. [2018-12-03 16:14:59,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:14:59,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:59,792 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:59,793 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:59,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:59,793 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-12-03 16:14:59,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:59,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:59,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:59,924 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 16:14:59,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:59,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:59,924 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-12-03 16:14:59,925 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [76], [84], [92], [251], [317], [323], [331], [333], [337], [339], [345], [351] [2018-12-03 16:14:59,926 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:14:59,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:14:59,944 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:14:59,944 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 16:14:59,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:59,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:14:59,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:59,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:14:59,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:59,973 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:59,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:00,111 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 16:15:00,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:00,169 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 16:15:00,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:00,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 16:15:00,190 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:00,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:15:00,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:15:00,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:15:00,191 INFO L87 Difference]: Start difference. First operand 1339 states and 2995 transitions. Second operand 19 states. [2018-12-03 16:15:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:10,665 INFO L93 Difference]: Finished difference Result 3654 states and 8066 transitions. [2018-12-03 16:15:10,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:15:10,666 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-12-03 16:15:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:10,670 INFO L225 Difference]: With dead ends: 3654 [2018-12-03 16:15:10,671 INFO L226 Difference]: Without dead ends: 3646 [2018-12-03 16:15:10,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1451 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1245, Invalid=4011, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 16:15:10,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2018-12-03 16:15:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 2136. [2018-12-03 16:15:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-12-03 16:15:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4855 transitions. [2018-12-03 16:15:13,579 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4855 transitions. Word has length 17 [2018-12-03 16:15:13,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:13,579 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4855 transitions. [2018-12-03 16:15:13,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:15:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4855 transitions. [2018-12-03 16:15:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:15:13,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:13,580 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:15:13,580 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:13,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:13,580 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-12-03 16:15:13,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:13,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:13,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:13,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:13,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:13,751 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 16:15:13,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:13,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:13,752 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:15:13,752 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [76], [84], [86], [92], [132], [203], [236], [245], [252], [254], [337], [345], [351] [2018-12-03 16:15:13,753 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:15:13,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:15:13,766 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:15:13,766 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 16:15:13,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:13,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:15:13,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:13,807 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 16:15:13,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:13,818 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:13,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:13,852 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 16:15:13,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:13,862 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 16:15:13,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:13,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 16:15:13,881 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:13,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:15:13,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:15:13,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:15:13,881 INFO L87 Difference]: Start difference. First operand 2136 states and 4855 transitions. Second operand 11 states. [2018-12-03 16:15:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:19,478 INFO L93 Difference]: Finished difference Result 2767 states and 6209 transitions. [2018-12-03 16:15:19,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:15:19,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:15:19,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:19,481 INFO L225 Difference]: With dead ends: 2767 [2018-12-03 16:15:19,481 INFO L226 Difference]: Without dead ends: 2759 [2018-12-03 16:15:19,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:15:19,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-12-03 16:15:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2216. [2018-12-03 16:15:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-12-03 16:15:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5027 transitions. [2018-12-03 16:15:22,688 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5027 transitions. Word has length 20 [2018-12-03 16:15:22,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:22,688 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5027 transitions. [2018-12-03 16:15:22,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:15:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5027 transitions. [2018-12-03 16:15:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:15:22,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:22,689 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 16:15:22,689 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:22,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:22,690 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-12-03 16:15:22,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:22,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:22,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:22,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:22,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:22,962 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 16:15:22,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:22,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:22,962 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:15:22,962 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [76], [84], [86], [92], [94], [98], [132], [203], [236], [245], [252], [337], [345], [351] [2018-12-03 16:15:22,963 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:15:22,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:15:22,977 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:15:22,977 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 16:15:22,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:22,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:15:22,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:22,992 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 16:15:23,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:23,007 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:23,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:23,040 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 16:15:23,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:23,052 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 16:15:23,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:23,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 16:15:23,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:23,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:15:23,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:15:23,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:15:23,071 INFO L87 Difference]: Start difference. First operand 2216 states and 5027 transitions. Second operand 11 states. [2018-12-03 16:15:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:29,345 INFO L93 Difference]: Finished difference Result 3146 states and 7011 transitions. [2018-12-03 16:15:29,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:15:29,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:15:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:29,349 INFO L225 Difference]: With dead ends: 3146 [2018-12-03 16:15:29,349 INFO L226 Difference]: Without dead ends: 3138 [2018-12-03 16:15:29,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:15:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-12-03 16:15:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2248. [2018-12-03 16:15:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-12-03 16:15:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5091 transitions. [2018-12-03 16:15:32,368 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5091 transitions. Word has length 20 [2018-12-03 16:15:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:32,368 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5091 transitions. [2018-12-03 16:15:32,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:15:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5091 transitions. [2018-12-03 16:15:32,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:15:32,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:32,369 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 16:15:32,369 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:32,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:32,370 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-12-03 16:15:32,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:32,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:32,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:32,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:32,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:32,452 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 16:15:32,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:32,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:32,453 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:15:32,453 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [76], [84], [86], [92], [94], [102], [132], [183], [203], [229], [252], [337], [345], [351] [2018-12-03 16:15:32,454 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:15:32,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:15:32,468 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:15:32,468 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 16:15:32,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:32,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:15:32,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:32,476 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 16:15:32,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:32,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:32,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:32,538 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 16:15:32,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:32,547 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 16:15:32,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:32,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 16:15:32,566 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:32,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:15:32,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:15:32,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:15:32,567 INFO L87 Difference]: Start difference. First operand 2248 states and 5091 transitions. Second operand 11 states. [2018-12-03 16:15:39,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:39,248 INFO L93 Difference]: Finished difference Result 3089 states and 6919 transitions. [2018-12-03 16:15:39,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:15:39,248 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:15:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:39,253 INFO L225 Difference]: With dead ends: 3089 [2018-12-03 16:15:39,253 INFO L226 Difference]: Without dead ends: 3081 [2018-12-03 16:15:39,254 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 16:15:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-12-03 16:15:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2246. [2018-12-03 16:15:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-12-03 16:15:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5087 transitions. [2018-12-03 16:15:42,368 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5087 transitions. Word has length 20 [2018-12-03 16:15:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:42,368 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5087 transitions. [2018-12-03 16:15:42,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:15:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5087 transitions. [2018-12-03 16:15:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:15:42,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:42,370 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 16:15:42,370 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:42,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:42,371 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-12-03 16:15:42,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:42,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:42,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:42,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:42,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:42,459 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 16:15:42,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:42,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:42,460 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:15:42,460 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 16:15:42,461 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:15:42,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:15:42,474 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:15:42,474 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 16:15:42,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:42,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:15:42,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:42,490 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 16:15:42,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:42,498 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:42,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:42,538 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 16:15:42,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:42,541 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 16:15:42,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:42,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 16:15:42,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:42,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:15:42,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:15:42,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:15:42,561 INFO L87 Difference]: Start difference. First operand 2246 states and 5087 transitions. Second operand 11 states. [2018-12-03 16:15:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:49,165 INFO L93 Difference]: Finished difference Result 3266 states and 7250 transitions. [2018-12-03 16:15:49,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:15:49,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:15:49,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:49,169 INFO L225 Difference]: With dead ends: 3266 [2018-12-03 16:15:49,169 INFO L226 Difference]: Without dead ends: 3258 [2018-12-03 16:15:49,170 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 16:15:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2018-12-03 16:15:52,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2328. [2018-12-03 16:15:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2328 states. [2018-12-03 16:15:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 5263 transitions. [2018-12-03 16:15:52,282 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 5263 transitions. Word has length 20 [2018-12-03 16:15:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:52,283 INFO L480 AbstractCegarLoop]: Abstraction has 2328 states and 5263 transitions. [2018-12-03 16:15:52,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:15:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 5263 transitions. [2018-12-03 16:15:52,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:15:52,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:52,284 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 16:15:52,284 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:52,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:52,284 INFO L82 PathProgramCache]: Analyzing trace with hash 718975582, now seen corresponding path program 1 times [2018-12-03 16:15:52,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:52,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:52,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:52,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:52,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:52,386 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 16:15:52,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:52,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:52,387 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:15:52,387 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 16:15:52,388 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:15:52,388 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:15:52,402 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:15:52,403 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 16:15:52,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:52,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:15:52,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:52,422 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 16:15:52,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:52,432 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:52,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:52,485 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 16:15:52,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:52,541 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 16:15:52,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:52,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 16:15:52,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:52,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:15:52,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:15:52,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:15:52,571 INFO L87 Difference]: Start difference. First operand 2328 states and 5263 transitions. Second operand 11 states. [2018-12-03 16:16:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:00,326 INFO L93 Difference]: Finished difference Result 3498 states and 7776 transitions. [2018-12-03 16:16:00,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:16:00,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:16:00,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:00,331 INFO L225 Difference]: With dead ends: 3498 [2018-12-03 16:16:00,331 INFO L226 Difference]: Without dead ends: 3490 [2018-12-03 16:16:00,332 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 16:16:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2018-12-03 16:16:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2262. [2018-12-03 16:16:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-12-03 16:16:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 5119 transitions. [2018-12-03 16:16:03,488 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 5119 transitions. Word has length 20 [2018-12-03 16:16:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:03,488 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 5119 transitions. [2018-12-03 16:16:03,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:16:03,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 5119 transitions. [2018-12-03 16:16:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:16:03,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:03,489 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 16:16:03,489 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:03,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:03,490 INFO L82 PathProgramCache]: Analyzing trace with hash 826825729, now seen corresponding path program 1 times [2018-12-03 16:16:03,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:03,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:03,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:03,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:03,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:04,229 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 16:16:04,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:04,229 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:04,230 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:16:04,230 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 16:16:04,231 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:16:04,231 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:16:04,250 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:16:04,251 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 16:16:04,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:04,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:16:04,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:04,257 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 16:16:04,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:04,266 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:16:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:04,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:04,296 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 16:16:04,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:04,305 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 16:16:04,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:04,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 16:16:04,324 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:04,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:16:04,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:16:04,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:16:04,324 INFO L87 Difference]: Start difference. First operand 2262 states and 5119 transitions. Second operand 11 states. [2018-12-03 16:16:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:11,429 INFO L93 Difference]: Finished difference Result 3139 states and 7021 transitions. [2018-12-03 16:16:11,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:16:11,430 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:16:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:11,434 INFO L225 Difference]: With dead ends: 3139 [2018-12-03 16:16:11,434 INFO L226 Difference]: Without dead ends: 3131 [2018-12-03 16:16:11,435 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 16:16:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2018-12-03 16:16:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 2262. [2018-12-03 16:16:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-12-03 16:16:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 5119 transitions. [2018-12-03 16:16:14,537 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 5119 transitions. Word has length 20 [2018-12-03 16:16:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:14,537 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 5119 transitions. [2018-12-03 16:16:14,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:16:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 5119 transitions. [2018-12-03 16:16:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:16:14,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:14,538 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 16:16:14,538 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:14,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:14,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1854611284, now seen corresponding path program 1 times [2018-12-03 16:16:14,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:14,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:14,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:14,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:14,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:14,639 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 16:16:14,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:14,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:14,639 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:16:14,639 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 16:16:14,640 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:16:14,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:16:14,652 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:16:14,653 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 16:16:14,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:14,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:16:14,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:14,670 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 16:16:14,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:14,678 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:16:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:14,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:14,737 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 16:16:14,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:14,748 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 16:16:14,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:14,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 16:16:14,767 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:14,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:16:14,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:16:14,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:16:14,767 INFO L87 Difference]: Start difference. First operand 2262 states and 5119 transitions. Second operand 11 states. [2018-12-03 16:16:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:20,876 INFO L93 Difference]: Finished difference Result 2951 states and 6564 transitions. [2018-12-03 16:16:20,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:16:20,877 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:16:20,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:20,880 INFO L225 Difference]: With dead ends: 2951 [2018-12-03 16:16:20,880 INFO L226 Difference]: Without dead ends: 2943 [2018-12-03 16:16:20,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:16:20,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2018-12-03 16:16:24,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2202. [2018-12-03 16:16:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2018-12-03 16:16:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 4975 transitions. [2018-12-03 16:16:24,214 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 4975 transitions. Word has length 20 [2018-12-03 16:16:24,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:24,214 INFO L480 AbstractCegarLoop]: Abstraction has 2202 states and 4975 transitions. [2018-12-03 16:16:24,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:16:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 4975 transitions. [2018-12-03 16:16:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:16:24,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:24,216 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 16:16:24,216 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:24,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:24,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1854713429, now seen corresponding path program 1 times [2018-12-03 16:16:24,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:24,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:24,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:24,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:24,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:24,297 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 16:16:24,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:24,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:24,297 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:16:24,297 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 16:16:24,298 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:16:24,298 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:16:24,313 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:16:24,313 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 16:16:24,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:24,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:16:24,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:24,333 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 16:16:24,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:24,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:16:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:24,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:24,415 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 16:16:24,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:24,442 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 16:16:24,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:24,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 16:16:24,461 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:24,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:16:24,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:16:24,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:16:24,462 INFO L87 Difference]: Start difference. First operand 2202 states and 4975 transitions. Second operand 11 states. [2018-12-03 16:16:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:31,739 INFO L93 Difference]: Finished difference Result 3183 states and 7090 transitions. [2018-12-03 16:16:31,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:16:31,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:16:31,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:31,743 INFO L225 Difference]: With dead ends: 3183 [2018-12-03 16:16:31,743 INFO L226 Difference]: Without dead ends: 3175 [2018-12-03 16:16:31,744 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 16:16:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2018-12-03 16:16:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2136. [2018-12-03 16:16:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-12-03 16:16:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4831 transitions. [2018-12-03 16:16:34,945 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4831 transitions. Word has length 20 [2018-12-03 16:16:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:34,945 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4831 transitions. [2018-12-03 16:16:34,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:16:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4831 transitions. [2018-12-03 16:16:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:16:34,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:34,946 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 16:16:34,946 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:34,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:34,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1962563576, now seen corresponding path program 1 times [2018-12-03 16:16:34,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:34,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:34,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:34,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:34,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:35,061 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 16:16:35,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:35,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:35,062 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:16:35,062 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 16:16:35,063 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:16:35,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:16:35,075 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:16:35,076 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 16:16:35,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:35,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:16:35,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:35,080 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 16:16:35,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:35,091 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:16:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:35,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:35,140 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 16:16:35,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:35,144 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 16:16:35,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:35,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 16:16:35,162 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:35,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:16:35,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:16:35,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:16:35,163 INFO L87 Difference]: Start difference. First operand 2136 states and 4831 transitions. Second operand 11 states. [2018-12-03 16:16:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:42,523 INFO L93 Difference]: Finished difference Result 3044 states and 6774 transitions. [2018-12-03 16:16:42,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:16:42,524 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:16:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:42,527 INFO L225 Difference]: With dead ends: 3044 [2018-12-03 16:16:42,528 INFO L226 Difference]: Without dead ends: 3036 [2018-12-03 16:16:42,528 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 16:16:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2018-12-03 16:16:45,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 1834. [2018-12-03 16:16:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2018-12-03 16:16:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 4141 transitions. [2018-12-03 16:16:45,222 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 4141 transitions. Word has length 20 [2018-12-03 16:16:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:45,222 INFO L480 AbstractCegarLoop]: Abstraction has 1834 states and 4141 transitions. [2018-12-03 16:16:45,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:16:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 4141 transitions. [2018-12-03 16:16:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:16:45,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:45,223 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 16:16:45,223 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:45,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:45,224 INFO L82 PathProgramCache]: Analyzing trace with hash 371911669, now seen corresponding path program 1 times [2018-12-03 16:16:45,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:45,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:45,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:45,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:45,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:45,323 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 16:16:45,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:45,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:45,324 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 16:16:45,324 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [59], [65], [72], [78], [113], [120], [126], [260], [262], [274], [279], [285], [343], [349] [2018-12-03 16:16:45,325 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:16:45,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:16:45,335 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:16:45,336 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 16:16:45,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:45,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:16:45,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:45,375 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 16:16:45,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:45,391 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:16:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:45,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:45,521 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 16:16:45,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:45,656 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 16:16:45,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:45,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2018-12-03 16:16:45,675 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:45,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:16:45,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:16:45,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:16:45,676 INFO L87 Difference]: Start difference. First operand 1834 states and 4141 transitions. Second operand 20 states. [2018-12-03 16:16:55,041 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-12-03 16:17:05,896 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 16:17:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:08,725 INFO L93 Difference]: Finished difference Result 5972 states and 13233 transitions. [2018-12-03 16:17:08,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-12-03 16:17:08,725 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-12-03 16:17:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:08,732 INFO L225 Difference]: With dead ends: 5972 [2018-12-03 16:17:08,732 INFO L226 Difference]: Without dead ends: 5964 [2018-12-03 16:17:08,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6656 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3054, Invalid=16128, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 16:17:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2018-12-03 16:17:13,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3311. [2018-12-03 16:17:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3311 states. [2018-12-03 16:17:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 7569 transitions. [2018-12-03 16:17:13,481 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 7569 transitions. Word has length 21 [2018-12-03 16:17:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:13,482 INFO L480 AbstractCegarLoop]: Abstraction has 3311 states and 7569 transitions. [2018-12-03 16:17:13,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:17:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 7569 transitions. [2018-12-03 16:17:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:17:13,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:13,483 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:17:13,483 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:13,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:13,483 INFO L82 PathProgramCache]: Analyzing trace with hash -461254251, now seen corresponding path program 2 times [2018-12-03 16:17:13,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:13,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:13,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:13,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:13,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:13,662 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 16:17:13,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:13,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:17:13,663 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:17:13,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:17:13,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:13,663 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 16:17:13,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:17:13,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:17:13,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:17:13,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:17:13,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:17:13,826 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 16:17:13,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:17:13,967 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 16:17:13,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:17:13,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2018-12-03 16:17:13,987 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:17:13,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:17:13,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:17:13,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:17:13,988 INFO L87 Difference]: Start difference. First operand 3311 states and 7569 transitions. Second operand 21 states. [2018-12-03 16:17:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:36,268 INFO L93 Difference]: Finished difference Result 6725 states and 15108 transitions. [2018-12-03 16:17:36,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 16:17:36,268 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 16:17:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:36,276 INFO L225 Difference]: With dead ends: 6725 [2018-12-03 16:17:36,276 INFO L226 Difference]: Without dead ends: 6717 [2018-12-03 16:17:36,278 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 16:17:36,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6717 states. [2018-12-03 16:17:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6717 to 2426. [2018-12-03 16:17:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2018-12-03 16:17:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 5536 transitions. [2018-12-03 16:17:40,506 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 5536 transitions. Word has length 21 [2018-12-03 16:17:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:40,506 INFO L480 AbstractCegarLoop]: Abstraction has 2426 states and 5536 transitions. [2018-12-03 16:17:40,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:17:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 5536 transitions. [2018-12-03 16:17:40,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:17:40,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:40,508 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 16:17:40,508 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:40,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:40,508 INFO L82 PathProgramCache]: Analyzing trace with hash 504785992, now seen corresponding path program 1 times [2018-12-03 16:17:40,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:40,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:40,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:17:40,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:40,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:40,599 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 16:17:40,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:40,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:17:40,600 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:17:40,600 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 16:17:40,601 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:17:40,602 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:17:40,613 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:17:40,613 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 16:17:40,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:40,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:17:40,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:40,649 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 16:17:40,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:40,658 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:17:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:40,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:17:40,767 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 16:17:40,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:17:40,823 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 16:17:40,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:17:40,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:17:40,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:17:40,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:17:40,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:17:40,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:17:40,844 INFO L87 Difference]: Start difference. First operand 2426 states and 5536 transitions. Second operand 13 states. [2018-12-03 16:17:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:54,332 INFO L93 Difference]: Finished difference Result 8061 states and 18335 transitions. [2018-12-03 16:17:54,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:17:54,333 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 16:17:54,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:54,339 INFO L225 Difference]: With dead ends: 8061 [2018-12-03 16:17:54,339 INFO L226 Difference]: Without dead ends: 5636 [2018-12-03 16:17:54,343 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 16:17:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5636 states. [2018-12-03 16:18:00,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5636 to 3316. [2018-12-03 16:18:00,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3316 states. [2018-12-03 16:18:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 7500 transitions. [2018-12-03 16:18:00,119 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 7500 transitions. Word has length 24 [2018-12-03 16:18:00,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:00,119 INFO L480 AbstractCegarLoop]: Abstraction has 3316 states and 7500 transitions. [2018-12-03 16:18:00,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:18:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 7500 transitions. [2018-12-03 16:18:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:18:00,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:00,121 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 16:18:00,121 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:00,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1269424552, now seen corresponding path program 1 times [2018-12-03 16:18:00,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:00,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:00,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:00,193 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 16:18:00,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:00,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:18:00,194 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:18:00,194 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 16:18:00,195 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:18:00,195 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:18:00,208 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:18:00,209 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 16:18:00,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:00,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:18:00,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:00,222 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 16:18:00,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:00,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:18:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:00,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:18:00,329 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 16:18:00,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:18:00,433 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 16:18:00,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:18:00,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-12-03 16:18:00,454 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:18:00,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:18:00,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:18:00,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:18:00,455 INFO L87 Difference]: Start difference. First operand 3316 states and 7500 transitions. Second operand 14 states. [2018-12-03 16:18:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:13,681 INFO L93 Difference]: Finished difference Result 9123 states and 20565 transitions. [2018-12-03 16:18:13,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:18:13,682 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-03 16:18:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:13,689 INFO L225 Difference]: With dead ends: 9123 [2018-12-03 16:18:13,689 INFO L226 Difference]: Without dead ends: 5808 [2018-12-03 16:18:13,695 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 16:18:13,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5808 states. [2018-12-03 16:18:19,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5808 to 3396. [2018-12-03 16:18:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3396 states. [2018-12-03 16:18:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 7743 transitions. [2018-12-03 16:18:19,235 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 7743 transitions. Word has length 24 [2018-12-03 16:18:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:19,235 INFO L480 AbstractCegarLoop]: Abstraction has 3396 states and 7743 transitions. [2018-12-03 16:18:19,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:18:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 7743 transitions. [2018-12-03 16:18:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:18:19,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:19,237 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 16:18:19,237 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:19,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:19,238 INFO L82 PathProgramCache]: Analyzing trace with hash -277435291, now seen corresponding path program 1 times [2018-12-03 16:18:19,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:19,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:19,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:19,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:19,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:19,857 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 16:18:19,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:19,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:18:19,858 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:18:19,858 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 16:18:19,859 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:18:19,859 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:18:19,886 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:18:19,886 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 16:18:19,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:19,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:18:19,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:19,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:18:19,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:19,938 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:18:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:19,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:18:20,080 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 16:18:20,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:18:20,166 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 16:18:20,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:18:20,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2018-12-03 16:18:20,185 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:18:20,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:18:20,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:18:20,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:18:20,186 INFO L87 Difference]: Start difference. First operand 3396 states and 7743 transitions. Second operand 15 states. [2018-12-03 16:18:35,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:35,820 INFO L93 Difference]: Finished difference Result 9753 states and 22123 transitions. [2018-12-03 16:18:35,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:18:35,821 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-12-03 16:18:35,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:35,828 INFO L225 Difference]: With dead ends: 9753 [2018-12-03 16:18:35,828 INFO L226 Difference]: Without dead ends: 6358 [2018-12-03 16:18:35,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=766, Invalid=2204, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:18:35,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6358 states. [2018-12-03 16:18:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6358 to 4049. [2018-12-03 16:18:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2018-12-03 16:18:42,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 9311 transitions. [2018-12-03 16:18:42,474 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 9311 transitions. Word has length 24 [2018-12-03 16:18:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:42,474 INFO L480 AbstractCegarLoop]: Abstraction has 4049 states and 9311 transitions. [2018-12-03 16:18:42,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:18:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 9311 transitions. [2018-12-03 16:18:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:18:42,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:42,476 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 16:18:42,476 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:42,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:42,476 INFO L82 PathProgramCache]: Analyzing trace with hash -290450663, now seen corresponding path program 1 times [2018-12-03 16:18:42,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:42,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:42,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:42,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:42,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:42,557 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 16:18:42,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:42,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:18:42,557 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:18:42,558 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 16:18:42,558 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:18:42,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:18:42,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:18:42,578 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 16:18:42,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:42,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:18:42,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:42,616 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 16:18:42,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:42,634 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:18:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:42,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:18:42,774 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 16:18:42,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:18:42,860 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 16:18:42,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:18:42,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2018-12-03 16:18:42,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:18:42,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:18:42,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:18:42,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:18:42,880 INFO L87 Difference]: Start difference. First operand 4049 states and 9311 transitions. Second operand 15 states. [2018-12-03 16:18:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:57,191 INFO L93 Difference]: Finished difference Result 10048 states and 22999 transitions. [2018-12-03 16:18:57,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:18:57,191 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-12-03 16:18:57,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:57,198 INFO L225 Difference]: With dead ends: 10048 [2018-12-03 16:18:57,198 INFO L226 Difference]: Without dead ends: 6000 [2018-12-03 16:18:57,203 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 16:18:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2018-12-03 16:19:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 4263. [2018-12-03 16:19:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2018-12-03 16:19:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 9793 transitions. [2018-12-03 16:19:04,308 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 9793 transitions. Word has length 24 [2018-12-03 16:19:04,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:04,308 INFO L480 AbstractCegarLoop]: Abstraction has 4263 states and 9793 transitions. [2018-12-03 16:19:04,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:19:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 9793 transitions. [2018-12-03 16:19:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:19:04,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:04,310 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 16:19:04,311 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:04,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:04,311 INFO L82 PathProgramCache]: Analyzing trace with hash 481433400, now seen corresponding path program 1 times [2018-12-03 16:19:04,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:04,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:04,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:04,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:04,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:04,381 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 16:19:04,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:04,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:19:04,382 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:19:04,382 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 16:19:04,383 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:19:04,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:19:04,394 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:19:04,394 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 16:19:04,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:04,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:19:04,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:04,437 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 16:19:04,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:04,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:19:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:04,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:19:04,746 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 16:19:04,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:19:04,815 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 16:19:04,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:19:04,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-12-03 16:19:04,835 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:19:04,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:19:04,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:19:04,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:19:04,836 INFO L87 Difference]: Start difference. First operand 4263 states and 9793 transitions. Second operand 14 states. [2018-12-03 16:19:21,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:21,110 INFO L93 Difference]: Finished difference Result 11665 states and 26624 transitions. [2018-12-03 16:19:21,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:19:21,110 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-03 16:19:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:21,123 INFO L225 Difference]: With dead ends: 11665 [2018-12-03 16:19:21,123 INFO L226 Difference]: Without dead ends: 7403 [2018-12-03 16:19:21,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=567, Invalid=1689, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:19:21,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7403 states. [2018-12-03 16:19:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7403 to 4888. [2018-12-03 16:19:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2018-12-03 16:19:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 11268 transitions. [2018-12-03 16:19:29,319 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 11268 transitions. Word has length 24 [2018-12-03 16:19:29,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:29,319 INFO L480 AbstractCegarLoop]: Abstraction has 4888 states and 11268 transitions. [2018-12-03 16:19:29,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:19:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 11268 transitions. [2018-12-03 16:19:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:19:29,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:29,323 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 16:19:29,323 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:29,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1900063568, now seen corresponding path program 1 times [2018-12-03 16:19:29,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:29,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:29,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:29,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:29,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:29,445 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 16:19:29,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:29,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:19:29,445 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:19:29,446 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 16:19:29,446 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:19:29,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:19:29,457 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:19:29,457 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 16:19:29,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:29,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:19:29,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:29,466 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 16:19:29,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:29,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:19:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:29,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:19:29,587 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 16:19:29,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:19:29,649 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 16:19:29,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:19:29,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-12-03 16:19:29,753 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:19:29,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:19:29,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:19:29,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:19:29,754 INFO L87 Difference]: Start difference. First operand 4888 states and 11268 transitions. Second operand 14 states. [2018-12-03 16:19:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:46,765 INFO L93 Difference]: Finished difference Result 12914 states and 29867 transitions. [2018-12-03 16:19:46,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:19:46,766 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-03 16:19:46,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:46,775 INFO L225 Difference]: With dead ends: 12914 [2018-12-03 16:19:46,775 INFO L226 Difference]: Without dead ends: 8027 [2018-12-03 16:19:46,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=671, Invalid=1779, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:19:46,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8027 states. [2018-12-03 16:19:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8027 to 5552. [2018-12-03 16:19:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5552 states. [2018-12-03 16:19:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 12965 transitions. [2018-12-03 16:19:55,467 INFO L78 Accepts]: Start accepts. Automaton has 5552 states and 12965 transitions. Word has length 24 [2018-12-03 16:19:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:55,467 INFO L480 AbstractCegarLoop]: Abstraction has 5552 states and 12965 transitions. [2018-12-03 16:19:55,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:19:55,467 INFO L276 IsEmpty]: Start isEmpty. Operand 5552 states and 12965 transitions. [2018-12-03 16:19:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:19:55,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:55,469 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 16:19:55,470 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:55,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:55,470 INFO L82 PathProgramCache]: Analyzing trace with hash -563138598, now seen corresponding path program 1 times [2018-12-03 16:19:55,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:55,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:55,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:55,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:55,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:55,821 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 16:19:55,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:55,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:19:55,821 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:19:55,822 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 16:19:55,822 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:19:55,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:19:55,839 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:19:55,839 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 16:19:55,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:55,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:19:55,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:55,876 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 16:19:55,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:55,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:19:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:55,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:19:55,985 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 16:19:55,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:19:56,065 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 16:19:56,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:19:56,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2018-12-03 16:19:56,085 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:19:56,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:19:56,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:19:56,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:19:56,086 INFO L87 Difference]: Start difference. First operand 5552 states and 12965 transitions. Second operand 14 states. [2018-12-03 16:20:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:20:13,243 INFO L93 Difference]: Finished difference Result 13640 states and 31538 transitions. [2018-12-03 16:20:13,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:20:13,243 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-03 16:20:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:20:13,252 INFO L225 Difference]: With dead ends: 13640 [2018-12-03 16:20:13,252 INFO L226 Difference]: Without dead ends: 8089 [2018-12-03 16:20:13,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=730, Invalid=2026, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:20:13,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8089 states. [2018-12-03 16:20:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8089 to 5556. [2018-12-03 16:20:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5556 states. [2018-12-03 16:20:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 12957 transitions. [2018-12-03 16:20:21,904 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 12957 transitions. Word has length 24 [2018-12-03 16:20:21,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:20:21,904 INFO L480 AbstractCegarLoop]: Abstraction has 5556 states and 12957 transitions. [2018-12-03 16:20:21,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:20:21,904 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 12957 transitions. [2018-12-03 16:20:21,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:20:21,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:20:21,907 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 16:20:21,907 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:20:21,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:21,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1568457909, now seen corresponding path program 1 times [2018-12-03 16:20:21,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:20:21,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:21,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:21,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:21,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:20:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:22,475 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-12-03 16:20:22,579 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 16:20:22,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:22,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:20:22,579 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:20:22,579 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 16:20:22,580 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:20:22,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:20:22,591 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:20:22,591 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 16:20:22,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:22,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:20:22,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:22,634 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 16:20:22,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:22,648 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:20:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:22,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:20:22,802 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 16:20:22,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:20:24,068 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 16:20:24,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:20:24,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2018-12-03 16:20:24,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:20:24,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:20:24,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:20:24,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:20:24,106 INFO L87 Difference]: Start difference. First operand 5556 states and 12957 transitions. Second operand 19 states. [2018-12-03 16:21:22,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:21:22,421 INFO L93 Difference]: Finished difference Result 24779 states and 57605 transitions. [2018-12-03 16:21:22,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 285 states. [2018-12-03 16:21:22,422 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 16:21:22,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:21:22,446 INFO L225 Difference]: With dead ends: 24779 [2018-12-03 16:21:22,446 INFO L226 Difference]: Without dead ends: 19224 [2018-12-03 16:21:22,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38328 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=8035, Invalid=81665, Unknown=0, NotChecked=0, Total=89700 [2018-12-03 16:21:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19224 states. [2018-12-03 16:21:39,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19224 to 9944. [2018-12-03 16:21:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9944 states. [2018-12-03 16:21:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9944 states to 9944 states and 23419 transitions. [2018-12-03 16:21:39,339 INFO L78 Accepts]: Start accepts. Automaton has 9944 states and 23419 transitions. Word has length 24 [2018-12-03 16:21:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:21:39,339 INFO L480 AbstractCegarLoop]: Abstraction has 9944 states and 23419 transitions. [2018-12-03 16:21:39,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:21:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 9944 states and 23419 transitions. [2018-12-03 16:21:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:21:39,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:21:39,343 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 16:21:39,343 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:21:39,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:21:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1340769778, now seen corresponding path program 1 times [2018-12-03 16:21:39,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:21:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:39,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:21:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:39,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:21:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:21:39,606 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 16:21:39,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:21:39,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:21:39,607 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:21:39,608 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 16:21:39,609 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:21:39,609 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:21:39,620 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:21:39,620 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 16:21:39,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:21:39,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:21:39,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:21:39,641 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 16:21:39,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:21:39,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:21:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:21:39,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:21:39,807 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 16:21:39,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:21:39,893 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 16:21:39,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:21:39,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2018-12-03 16:21:39,913 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:21:39,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:21:39,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:21:39,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:21:39,914 INFO L87 Difference]: Start difference. First operand 9944 states and 23419 transitions. Second operand 19 states. [2018-12-03 16:22:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:22:31,516 INFO L93 Difference]: Finished difference Result 32192 states and 74985 transitions. [2018-12-03 16:22:31,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-12-03 16:22:31,516 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 16:22:31,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:22:31,546 INFO L225 Difference]: With dead ends: 32192 [2018-12-03 16:22:31,546 INFO L226 Difference]: Without dead ends: 22249 [2018-12-03 16:22:31,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7823 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2570, Invalid=19482, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 16:22:31,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22249 states. [2018-12-03 16:22:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22249 to 10853. [2018-12-03 16:22:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10853 states. [2018-12-03 16:22:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10853 states to 10853 states and 25572 transitions. [2018-12-03 16:22:49,788 INFO L78 Accepts]: Start accepts. Automaton has 10853 states and 25572 transitions. Word has length 24 [2018-12-03 16:22:49,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:22:49,789 INFO L480 AbstractCegarLoop]: Abstraction has 10853 states and 25572 transitions. [2018-12-03 16:22:49,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:22:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 10853 states and 25572 transitions. [2018-12-03 16:22:49,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:22:49,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:22:49,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, 1, 1, 1, 1] [2018-12-03 16:22:49,792 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:22:49,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:49,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1338856576, now seen corresponding path program 1 times [2018-12-03 16:22:49,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:22:49,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:49,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:22:49,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:49,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:22:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:49,908 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 16:22:49,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:49,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:22:49,909 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:22:49,909 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 16:22:49,910 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:22:49,910 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:22:49,935 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:22:49,935 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 16:22:49,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:49,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:22:49,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:49,943 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 16:22:49,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:22:49,962 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:22:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:49,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:22:50,096 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 16:22:50,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:22:51,072 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 16:22:51,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:22:51,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2018-12-03 16:22:51,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:22:51,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:22:51,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:22:51,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:22:51,110 INFO L87 Difference]: Start difference. First operand 10853 states and 25572 transitions. Second operand 19 states. [2018-12-03 16:23:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:23:25,263 INFO L93 Difference]: Finished difference Result 25628 states and 59763 transitions. [2018-12-03 16:23:25,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:23:25,264 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 16:23:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:23:25,283 INFO L225 Difference]: With dead ends: 25628 [2018-12-03 16:23:25,283 INFO L226 Difference]: Without dead ends: 14776 [2018-12-03 16:23:25,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1842 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=790, Invalid=6016, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 16:23:25,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14776 states. [2018-12-03 16:23:43,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14776 to 11098. [2018-12-03 16:23:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11098 states. [2018-12-03 16:23:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11098 states to 11098 states and 26149 transitions. [2018-12-03 16:23:43,860 INFO L78 Accepts]: Start accepts. Automaton has 11098 states and 26149 transitions. Word has length 24 [2018-12-03 16:23:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:23:43,860 INFO L480 AbstractCegarLoop]: Abstraction has 11098 states and 26149 transitions. [2018-12-03 16:23:43,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:23:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 11098 states and 26149 transitions. [2018-12-03 16:23:43,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:23:43,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:23:43,863 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 16:23:43,863 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:23:43,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:23:43,863 INFO L82 PathProgramCache]: Analyzing trace with hash -440997654, now seen corresponding path program 1 times [2018-12-03 16:23:43,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:23:43,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:43,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:23:43,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:43,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:23:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:43,989 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 16:23:43,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:43,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:23:43,990 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:23:43,991 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 16:23:43,992 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:23:43,992 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:23:44,015 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:23:44,015 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 16:23:44,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:23:44,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:23:44,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:44,028 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 16:23:44,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:23:44,036 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:23:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:44,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:23:44,169 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 16:23:44,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:23:44,292 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 16:23:44,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:23:44,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2018-12-03 16:23:44,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:23:44,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:23:44,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:23:44,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:23:44,312 INFO L87 Difference]: Start difference. First operand 11098 states and 26149 transitions. Second operand 19 states. [2018-12-03 16:24:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:16,492 INFO L93 Difference]: Finished difference Result 25128 states and 58685 transitions. [2018-12-03 16:24:16,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:24:16,492 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 16:24:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:16,510 INFO L225 Difference]: With dead ends: 25128 [2018-12-03 16:24:16,510 INFO L226 Difference]: Without dead ends: 14031 [2018-12-03 16:24:16,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=616, Invalid=4214, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:24:16,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14031 states. [2018-12-03 16:24:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14031 to 11149. [2018-12-03 16:24:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11149 states. [2018-12-03 16:24:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11149 states to 11149 states and 26230 transitions. [2018-12-03 16:24:35,828 INFO L78 Accepts]: Start accepts. Automaton has 11149 states and 26230 transitions. Word has length 24 [2018-12-03 16:24:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:35,828 INFO L480 AbstractCegarLoop]: Abstraction has 11149 states and 26230 transitions. [2018-12-03 16:24:35,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:24:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 11149 states and 26230 transitions. [2018-12-03 16:24:35,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:24:35,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:35,832 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 16:24:35,832 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:35,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:35,832 INFO L82 PathProgramCache]: Analyzing trace with hash 556057282, now seen corresponding path program 1 times [2018-12-03 16:24:35,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:35,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:35,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:35,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:35,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:35,952 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 16:24:35,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:35,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:35,953 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:24:35,953 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 16:24:35,954 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:24:35,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:24:35,976 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:24:35,977 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 16:24:35,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:35,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:24:35,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:35,984 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 16:24:35,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:35,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:35,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:36,126 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 16:24:36,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:36,276 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 16:24:36,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:36,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2018-12-03 16:24:36,295 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:36,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:24:36,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:24:36,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:24:36,296 INFO L87 Difference]: Start difference. First operand 11149 states and 26230 transitions. Second operand 19 states. [2018-12-03 16:25:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:11,954 INFO L93 Difference]: Finished difference Result 27547 states and 64697 transitions. [2018-12-03 16:25:11,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:25:11,954 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 16:25:11,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:11,974 INFO L225 Difference]: With dead ends: 27547 [2018-12-03 16:25:11,975 INFO L226 Difference]: Without dead ends: 16399 [2018-12-03 16:25:11,988 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 16:25:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16399 states.