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.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:11:15,922 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:11:15,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:11:15,944 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:11:15,944 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:11:15,945 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:11:15,948 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:11:15,951 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:11:15,954 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:11:15,957 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:11:15,958 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:11:15,959 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:11:15,960 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:11:15,964 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:11:15,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:11:15,971 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:11:15,975 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:11:15,977 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:11:15,982 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:11:15,985 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:11:15,987 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:11:15,988 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:11:15,990 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:11:15,991 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:11:15,991 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:11:15,992 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:11:15,994 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:11:15,995 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:11:15,996 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:11:15,997 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:11:15,997 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:11:16,000 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:11:16,000 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:11:16,000 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:11:16,001 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:11:16,002 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:11:16,002 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:16,025 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:11:16,025 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:11:16,026 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:11:16,026 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:11:16,027 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:11:16,027 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:11:16,027 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:11:16,027 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:11:16,027 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:11:16,028 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:11:16,028 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:11:16,028 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:11:16,029 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:11:16,029 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:11:16,029 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:11:16,030 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:11:16,030 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:11:16,030 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:11:16,030 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:11:16,031 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:11:16,033 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:11:16,033 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:11:16,033 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:11:16,033 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:11:16,033 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:11:16,033 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:11:16,034 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:11:16,034 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:11:16,034 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:11:16,034 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:11:16,034 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:11:16,035 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:11:16,035 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:11:16,035 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:11:16,035 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:11:16,035 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:11:16,036 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:11:16,036 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:11:16,036 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:11:16,036 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:11:16,036 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:11:16,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:11:16,085 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:11:16,088 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:11:16,090 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:11:16,091 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:11:16,091 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-12-03 16:11:16,092 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-12-03 16:11:16,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:11:16,156 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:11:16,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:16,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:11:16,158 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:11:16,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:16" (1/1) ... [2018-12-03 16:11:16,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:16" (1/1) ... [2018-12-03 16:11:16,211 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:11:16,212 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:11:16,212 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:11:16,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:16,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:11:16,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:11:16,221 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:11:16,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:16" (1/1) ... [2018-12-03 16:11:16,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:16" (1/1) ... [2018-12-03 16:11:16,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:16" (1/1) ... [2018-12-03 16:11:16,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:16" (1/1) ... [2018-12-03 16:11:16,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:16" (1/1) ... [2018-12-03 16:11:16,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:16" (1/1) ... [2018-12-03 16:11:16,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:16" (1/1) ... [2018-12-03 16:11:16,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:11:16,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:11:16,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:11:16,285 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:11:16,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:16" (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:16,358 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 16:11:16,358 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 16:11:16,359 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 16:11:17,139 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:11:17,139 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:11:17,140 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:17 BoogieIcfgContainer [2018-12-03 16:11:17,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:11:17,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:11:17,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:11:17,144 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:11:17,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:16" (1/2) ... [2018-12-03 16:11:17,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c3521f and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:11:17, skipping insertion in model container [2018-12-03 16:11:17,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:17" (2/2) ... [2018-12-03 16:11:17,148 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-12-03 16:11:17,158 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:11:17,166 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-12-03 16:11:17,185 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-12-03 16:11:17,222 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:11:17,222 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:11:17,223 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:11:17,223 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:11:17,223 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:11:17,223 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:11:17,223 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:11:17,223 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:11:17,244 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-12-03 16:11:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:11:17,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:17,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:17,256 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:17,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:17,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-12-03 16:11:17,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:17,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:17,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:17,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:17,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:17,618 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:17,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:17,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:11:17,621 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:17,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:11:17,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:11:17,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:11:17,642 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-12-03 16:11:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:19,497 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-12-03 16:11:19,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:11:19,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 16:11:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:19,517 INFO L225 Difference]: With dead ends: 163 [2018-12-03 16:11:19,517 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 16:11:19,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:11:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 16:11:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-12-03 16:11:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 16:11:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-12-03 16:11:19,591 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-12-03 16:11:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:19,591 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-12-03 16:11:19,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:11:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-12-03 16:11:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:11:19,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:19,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:19,595 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:19,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:19,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-12-03 16:11:19,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:19,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:19,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:19,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:19,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:19,926 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:19,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:19,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:11:19,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:19,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:11:19,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:11:19,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:11:19,930 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-12-03 16:11:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:20,884 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-12-03 16:11:20,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:11:20,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 16:11:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:20,890 INFO L225 Difference]: With dead ends: 188 [2018-12-03 16:11:20,890 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 16:11:20,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:11:20,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 16:11:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-12-03 16:11:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 16:11:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-12-03 16:11:20,917 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-12-03 16:11:20,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:20,917 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-12-03 16:11:20,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:11:20,917 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-12-03 16:11:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:11:20,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:20,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:20,920 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:20,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:20,920 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-12-03 16:11:20,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:20,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:20,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:20,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:20,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:21,036 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:21,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:21,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:11:21,037 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:21,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:11:21,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:11:21,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:11:21,039 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-12-03 16:11:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:22,773 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-12-03 16:11:22,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:11:22,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 16:11:22,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:22,783 INFO L225 Difference]: With dead ends: 361 [2018-12-03 16:11:22,783 INFO L226 Difference]: Without dead ends: 349 [2018-12-03 16:11:22,784 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:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-03 16:11:22,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-12-03 16:11:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 16:11:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-12-03 16:11:22,842 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-12-03 16:11:22,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:22,843 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-12-03 16:11:22,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:11:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-12-03 16:11:22,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:11:22,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:22,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:22,846 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:22,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:22,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-12-03 16:11:22,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:22,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:22,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:22,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:22,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:22,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:22,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:11:22,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:22,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:11:22,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:11:22,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:11:22,985 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-12-03 16:11:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:24,627 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-12-03 16:11:24,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:11:24,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 16:11:24,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:24,632 INFO L225 Difference]: With dead ends: 307 [2018-12-03 16:11:24,632 INFO L226 Difference]: Without dead ends: 302 [2018-12-03 16:11:24,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:11:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-03 16:11:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-12-03 16:11:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 16:11:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-12-03 16:11:24,671 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-12-03 16:11:24,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:24,671 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-12-03 16:11:24,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:11:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-12-03 16:11:24,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:24,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:24,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:24,674 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:24,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:24,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-12-03 16:11:24,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:24,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:24,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:24,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:24,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:25,055 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:25,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:25,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:25,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:25,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:25,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:25,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:25,058 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-12-03 16:11:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:28,210 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-12-03 16:11:28,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:11:28,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:11:28,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:28,222 INFO L225 Difference]: With dead ends: 741 [2018-12-03 16:11:28,223 INFO L226 Difference]: Without dead ends: 733 [2018-12-03 16:11:28,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:11:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-12-03 16:11:28,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-12-03 16:11:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-03 16:11:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-12-03 16:11:28,286 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-12-03 16:11:28,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:28,286 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-12-03 16:11:28,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-12-03 16:11:28,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:28,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:28,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:28,290 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:28,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:28,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-12-03 16:11:28,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:28,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:28,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:28,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:28,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:28,462 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:28,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:28,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:28,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:28,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:28,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:28,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:28,464 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-12-03 16:11:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:33,856 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-12-03 16:11:33,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:11:33,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:11:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:33,863 INFO L225 Difference]: With dead ends: 797 [2018-12-03 16:11:33,864 INFO L226 Difference]: Without dead ends: 789 [2018-12-03 16:11:33,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:11:33,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-12-03 16:11:33,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-12-03 16:11:33,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-12-03 16:11:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-12-03 16:11:33,930 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-12-03 16:11:33,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:33,930 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-12-03 16:11:33,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-12-03 16:11:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:33,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:33,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:33,933 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:33,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:33,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-12-03 16:11:33,934 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,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:33,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:34,141 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,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:34,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:34,142 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:34,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:34,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:34,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:34,143 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-12-03 16:11:36,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:36,196 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-12-03 16:11:36,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:11:36,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:11:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:36,206 INFO L225 Difference]: With dead ends: 684 [2018-12-03 16:11:36,206 INFO L226 Difference]: Without dead ends: 676 [2018-12-03 16:11:36,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:11:36,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-12-03 16:11:36,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-12-03 16:11:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-12-03 16:11:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-12-03 16:11:36,268 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-12-03 16:11:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:36,268 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-12-03 16:11:36,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-12-03 16:11:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:36,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:36,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:36,270 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:36,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:36,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-12-03 16:11:36,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:36,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:36,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:36,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:36,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:36,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:36,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:36,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:36,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:36,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:36,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:36,361 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-12-03 16:11:37,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:37,780 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-12-03 16:11:37,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:11:37,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:11:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:37,785 INFO L225 Difference]: With dead ends: 605 [2018-12-03 16:11:37,785 INFO L226 Difference]: Without dead ends: 597 [2018-12-03 16:11:37,786 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:11:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-12-03 16:11:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-12-03 16:11:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-12-03 16:11:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-12-03 16:11:37,856 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-12-03 16:11:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:37,856 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-12-03 16:11:37,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-12-03 16:11:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:37,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:37,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:37,858 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:37,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-12-03 16:11:37,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:37,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:37,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:37,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:37,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:38,051 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:38,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:38,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:38,052 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:38,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:38,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:38,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:38,053 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-12-03 16:11:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:40,379 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-12-03 16:11:40,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:11:40,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:11:40,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:40,387 INFO L225 Difference]: With dead ends: 935 [2018-12-03 16:11:40,387 INFO L226 Difference]: Without dead ends: 927 [2018-12-03 16:11:40,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:11:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-03 16:11:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-12-03 16:11:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-12-03 16:11:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-12-03 16:11:40,475 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-12-03 16:11:40,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:40,476 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-12-03 16:11:40,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-12-03 16:11:40,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:40,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:40,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:40,478 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:40,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:40,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-12-03 16:11:40,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:40,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:40,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:40,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:40,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:40,562 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:40,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:40,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:40,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:40,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:40,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:40,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:40,564 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-12-03 16:11:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:42,636 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-12-03 16:11:42,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:11:42,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:11:42,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:42,642 INFO L225 Difference]: With dead ends: 923 [2018-12-03 16:11:42,642 INFO L226 Difference]: Without dead ends: 915 [2018-12-03 16:11:42,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:11:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-12-03 16:11:42,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-12-03 16:11:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-03 16:11:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-12-03 16:11:42,731 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-12-03 16:11:42,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:42,731 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-12-03 16:11:42,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-12-03 16:11:42,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:42,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:42,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:42,733 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:42,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:42,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-12-03 16:11:42,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:42,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:42,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:42,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:42,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:43,281 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:43,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:43,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:43,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:43,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:43,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:43,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:43,283 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-12-03 16:11:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:45,057 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-12-03 16:11:45,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:11:45,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:11:45,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:45,062 INFO L225 Difference]: With dead ends: 837 [2018-12-03 16:11:45,062 INFO L226 Difference]: Without dead ends: 829 [2018-12-03 16:11:45,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:11:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-12-03 16:11:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-12-03 16:11:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-12-03 16:11:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-12-03 16:11:45,169 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-12-03 16:11:45,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:45,169 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-12-03 16:11:45,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-12-03 16:11:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:45,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:45,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:45,171 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:45,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:45,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-12-03 16:11:45,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:45,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:45,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:45,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:45,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:45,442 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:45,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:45,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:45,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:45,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:45,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:45,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:45,444 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-12-03 16:11:47,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:47,709 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-12-03 16:11:47,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:11:47,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:11:47,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:47,714 INFO L225 Difference]: With dead ends: 996 [2018-12-03 16:11:47,714 INFO L226 Difference]: Without dead ends: 988 [2018-12-03 16:11:47,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:11:47,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-12-03 16:11:47,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-12-03 16:11:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-12-03 16:11:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-12-03 16:11:47,823 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-12-03 16:11:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:47,825 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-12-03 16:11:47,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-12-03 16:11:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:47,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:47,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:47,827 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:47,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:47,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-12-03 16:11:47,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:47,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:47,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:47,912 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:47,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:47,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:47,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:47,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:47,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:47,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:47,914 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-12-03 16:11:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:49,851 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-12-03 16:11:49,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:11:49,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:11:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:49,858 INFO L225 Difference]: With dead ends: 913 [2018-12-03 16:11:49,858 INFO L226 Difference]: Without dead ends: 905 [2018-12-03 16:11:49,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:11:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-12-03 16:11:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-12-03 16:11:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-12-03 16:11:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-12-03 16:11:49,966 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-12-03 16:11:49,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:49,967 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-12-03 16:11:49,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:49,967 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-12-03 16:11:49,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:49,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:49,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:49,968 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:49,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:49,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-12-03 16:11:49,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:49,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:49,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:49,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:49,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:50,056 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,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:50,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:50,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:50,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:50,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:50,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:50,058 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-12-03 16:11:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:51,758 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-12-03 16:11:51,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:11:51,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:11:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:51,763 INFO L225 Difference]: With dead ends: 886 [2018-12-03 16:11:51,763 INFO L226 Difference]: Without dead ends: 878 [2018-12-03 16:11:51,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:11:51,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-12-03 16:11:51,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-12-03 16:11:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-03 16:11:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-12-03 16:11:51,869 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-12-03 16:11:51,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:51,870 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-12-03 16:11:51,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-12-03 16:11:51,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:51,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:51,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:51,871 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:51,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:51,871 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-12-03 16:11:51,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:51,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:51,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:51,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:51,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:51,956 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:51,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:51,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:51,957 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:51,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:11:51,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:11:51,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:11:51,958 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-12-03 16:11:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:53,945 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-12-03 16:11:53,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:11:53,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:11:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:53,951 INFO L225 Difference]: With dead ends: 801 [2018-12-03 16:11:53,951 INFO L226 Difference]: Without dead ends: 793 [2018-12-03 16:11:53,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:11:53,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-12-03 16:11:54,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-12-03 16:11:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-12-03 16:11:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-12-03 16:11:54,090 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-12-03 16:11:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:54,090 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-12-03 16:11:54,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:11:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-12-03 16:11:54,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:54,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:54,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:54,092 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:54,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:54,092 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-12-03 16:11:54,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:54,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:54,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:54,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:54,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:54,179 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:54,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:54,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:54,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:54,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:11:54,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:11:54,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:11:54,181 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-12-03 16:11:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:56,732 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-12-03 16:11:56,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:11:56,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:11:56,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:56,738 INFO L225 Difference]: With dead ends: 962 [2018-12-03 16:11:56,738 INFO L226 Difference]: Without dead ends: 954 [2018-12-03 16:11:56,739 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:11:56,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-12-03 16:11:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-12-03 16:11:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-12-03 16:11:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-12-03 16:11:56,971 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-12-03 16:11:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:56,971 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-12-03 16:11:56,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:11:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-12-03 16:11:56,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:56,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:56,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:56,973 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:56,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:56,973 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-12-03 16:11:56,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:56,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:56,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:56,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:56,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:57,296 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:57,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:57,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:11:57,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:57,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:11:57,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:11:57,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:11:57,297 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-12-03 16:11:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:59,704 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-12-03 16:11:59,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:11:59,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:11:59,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:59,709 INFO L225 Difference]: With dead ends: 1000 [2018-12-03 16:11:59,709 INFO L226 Difference]: Without dead ends: 992 [2018-12-03 16:11:59,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:11:59,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-12-03 16:11:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-12-03 16:11:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-12-03 16:11:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-12-03 16:11:59,888 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-12-03 16:11:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:59,889 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-12-03 16:11:59,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:11:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-12-03 16:11:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:11:59,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:59,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:59,890 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:59,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:59,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-12-03 16:11:59,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:59,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:59,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:59,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:59,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:00,067 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:00,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:00,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:00,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:00,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:12:00,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:12:00,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:12:00,069 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-12-03 16:12:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:02,940 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-12-03 16:12:02,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:12:02,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:12:02,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:02,945 INFO L225 Difference]: With dead ends: 1065 [2018-12-03 16:12:02,945 INFO L226 Difference]: Without dead ends: 1057 [2018-12-03 16:12:02,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:12:02,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-12-03 16:12:03,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-12-03 16:12:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-12-03 16:12:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-12-03 16:12:03,158 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-12-03 16:12:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:03,159 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-12-03 16:12:03,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:12:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-12-03 16:12:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:03,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:03,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:03,160 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:03,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:03,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-12-03 16:12:03,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:03,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:03,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:03,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:03,269 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:03,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:03,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:03,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:03,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:12:03,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:12:03,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:12:03,271 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-12-03 16:12:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:06,626 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-12-03 16:12:06,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:12:06,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:12:06,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:06,633 INFO L225 Difference]: With dead ends: 1227 [2018-12-03 16:12:06,633 INFO L226 Difference]: Without dead ends: 1219 [2018-12-03 16:12:06,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 16:12:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-12-03 16:12:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-12-03 16:12:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-12-03 16:12:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-12-03 16:12:06,846 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-12-03 16:12:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:06,846 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-12-03 16:12:06,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:12:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-12-03 16:12:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:06,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:06,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:06,848 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:06,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:06,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-12-03 16:12:06,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:06,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:06,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:06,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:06,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:06,954 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:06,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:06,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:06,955 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:06,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:12:06,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:12:06,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:12:06,956 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-12-03 16:12:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:09,803 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-12-03 16:12:09,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:12:09,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:12:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:09,808 INFO L225 Difference]: With dead ends: 1076 [2018-12-03 16:12:09,809 INFO L226 Difference]: Without dead ends: 1068 [2018-12-03 16:12:09,809 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:12:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-12-03 16:12:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-12-03 16:12:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-12-03 16:12:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-12-03 16:12:10,064 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-12-03 16:12:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:10,064 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-12-03 16:12:10,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:12:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-12-03 16:12:10,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:10,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:10,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:10,065 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:10,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:10,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-12-03 16:12:10,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:10,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:10,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:10,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:10,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:10,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:10,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:10,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:10,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:12:10,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:12:10,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:12:10,167 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-12-03 16:12:12,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:12,864 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-12-03 16:12:12,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:12:12,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:12:12,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:12,871 INFO L225 Difference]: With dead ends: 1111 [2018-12-03 16:12:12,871 INFO L226 Difference]: Without dead ends: 1103 [2018-12-03 16:12:12,872 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:12:12,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-12-03 16:12:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-12-03 16:12:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-03 16:12:13,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-12-03 16:12:13,195 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-12-03 16:12:13,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:13,195 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-12-03 16:12:13,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:12:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-12-03 16:12:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:13,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:13,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:13,196 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:13,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:13,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-12-03 16:12:13,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:13,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:13,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:13,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:13,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:13,399 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,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:13,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:13,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:13,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:12:13,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:12:13,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:12:13,401 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-12-03 16:12:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:16,856 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-12-03 16:12:16,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:12:16,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:12:16,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:16,863 INFO L225 Difference]: With dead ends: 1304 [2018-12-03 16:12:16,863 INFO L226 Difference]: Without dead ends: 1296 [2018-12-03 16:12:16,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:12:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-12-03 16:12:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-12-03 16:12:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-12-03 16:12:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-12-03 16:12:17,192 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-12-03 16:12:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:17,192 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-12-03 16:12:17,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:12:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-12-03 16:12:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:17,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:17,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:17,193 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:17,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:17,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-12-03 16:12:17,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:17,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:17,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:17,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:17,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:17,300 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:17,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:17,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:17,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:17,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:12:17,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:12:17,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:12:17,302 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-12-03 16:12:21,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:21,197 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-12-03 16:12:21,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:12:21,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:12:21,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:21,205 INFO L225 Difference]: With dead ends: 1370 [2018-12-03 16:12:21,205 INFO L226 Difference]: Without dead ends: 1362 [2018-12-03 16:12:21,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:12:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-12-03 16:12:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-12-03 16:12:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-12-03 16:12:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-12-03 16:12:21,519 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-12-03 16:12:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:21,519 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-12-03 16:12:21,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:12:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-12-03 16:12:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:21,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:21,520 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:21,521 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:21,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:21,521 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-12-03 16:12:21,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:21,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:21,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:21,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:21,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:21,612 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:21,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:21,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:21,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:21,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:12:21,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:12:21,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:12:21,614 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-12-03 16:12:24,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:24,535 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-12-03 16:12:24,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:12:24,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 16:12:24,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:24,540 INFO L225 Difference]: With dead ends: 1298 [2018-12-03 16:12:24,541 INFO L226 Difference]: Without dead ends: 1290 [2018-12-03 16:12:24,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:12:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-12-03 16:12:24,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-12-03 16:12:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-12-03 16:12:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-12-03 16:12:24,978 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-12-03 16:12:24,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:24,978 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-12-03 16:12:24,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:12:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-12-03 16:12:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:12:24,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:24,979 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:24,979 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:24,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:24,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-12-03 16:12:24,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:24,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:24,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:24,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:24,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:25,029 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:25,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:25,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:12:25,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:25,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:12:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:12:25,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:12:25,031 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-12-03 16:12:25,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:25,915 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-12-03 16:12:25,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:12:25,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 16:12:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:25,917 INFO L225 Difference]: With dead ends: 1242 [2018-12-03 16:12:25,917 INFO L226 Difference]: Without dead ends: 673 [2018-12-03 16:12:25,920 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:25,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-12-03 16:12:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-12-03 16:12:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-12-03 16:12:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-12-03 16:12:26,409 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-12-03 16:12:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:26,409 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-12-03 16:12:26,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:12:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-12-03 16:12:26,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:12:26,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:26,410 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:26,410 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:26,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:26,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-12-03 16:12:26,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:26,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:26,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:26,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:26,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:26,497 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:26,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:26,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:26,499 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 16:12:26,500 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [67], [72], [78], [279], [285], [286], [349] [2018-12-03 16:12:26,535 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:26,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:26,768 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:26,769 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:26,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:26,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:26,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:26,814 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:26,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:26,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:26,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:27,612 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:27,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:27,924 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:27,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:27,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2018-12-03 16:12:27,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:27,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:12:27,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:12:27,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:12:27,945 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-12-03 16:12:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:32,655 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-12-03 16:12:32,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:12:32,656 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-12-03 16:12:32,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:32,658 INFO L225 Difference]: With dead ends: 854 [2018-12-03 16:12:32,658 INFO L226 Difference]: Without dead ends: 849 [2018-12-03 16:12:32,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:12:32,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-12-03 16:12:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-12-03 16:12:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-12-03 16:12:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-12-03 16:12:33,699 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-12-03 16:12:33,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:33,700 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-12-03 16:12:33,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:12:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-12-03 16:12:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:12:33,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:33,701 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:33,701 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:33,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:33,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-12-03 16:12:33,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:33,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:33,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:33,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:33,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:33,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:33,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:12:33,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:33,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:12:33,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:12:33,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:12:33,908 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-12-03 16:12:34,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:34,836 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-12-03 16:12:34,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:12:34,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 16:12:34,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:34,839 INFO L225 Difference]: With dead ends: 1308 [2018-12-03 16:12:34,839 INFO L226 Difference]: Without dead ends: 709 [2018-12-03 16:12:34,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:34,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-12-03 16:12:35,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-12-03 16:12:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-12-03 16:12:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-12-03 16:12:35,572 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-12-03 16:12:35,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:35,572 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-12-03 16:12:35,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:12:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-12-03 16:12:35,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:12:35,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:35,573 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:35,573 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:35,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:35,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-12-03 16:12:35,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:35,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:35,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:35,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:35,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:35,688 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:35,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:35,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:35,688 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:12:35,689 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [113], [122], [199], [203], [207], [236], [245], [254], [260], [274], [349] [2018-12-03 16:12:35,690 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:35,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:35,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:35,705 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:12:35,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:35,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:35,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:35,726 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:12:35,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:35,736 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:35,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:35,915 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:35,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:36,196 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:36,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:36,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 16:12:36,216 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:36,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:12:36,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:12:36,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:12:36,217 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. [2018-12-03 16:12:40,933 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-03 16:12:45,359 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 16:12:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:51,421 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions. [2018-12-03 16:12:51,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-12-03 16:12:51,421 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 16:12:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:51,425 INFO L225 Difference]: With dead ends: 2011 [2018-12-03 16:12:51,425 INFO L226 Difference]: Without dead ends: 2003 [2018-12-03 16:12:51,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9618 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3726, Invalid=23996, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 16:12:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-12-03 16:12:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151. [2018-12-03 16:12:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-12-03 16:12:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions. [2018-12-03 16:12:52,659 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16 [2018-12-03 16:12:52,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:52,659 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions. [2018-12-03 16:12:52,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:12:52,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions. [2018-12-03 16:12:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:12:52,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:52,660 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:52,661 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:52,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:52,661 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-12-03 16:12:52,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:52,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:52,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:52,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:52,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:52,754 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:52,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:52,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:52,754 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:12:52,755 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [92], [115], [199], [203], [207], [236], [245], [254], [260], [274], [349] [2018-12-03 16:12:52,756 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:52,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:52,769 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:52,770 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:12:52,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:52,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:52,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:52,785 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:12:52,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:52,794 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:52,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:53,012 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:53,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:53,157 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:53,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:53,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 16:12:53,178 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:53,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:12:53,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:12:53,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:12:53,179 INFO L87 Difference]: Start difference. First operand 1151 states and 2622 transitions. Second operand 17 states. [2018-12-03 16:13:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:06,074 INFO L93 Difference]: Finished difference Result 2797 states and 6168 transitions. [2018-12-03 16:13:06,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-12-03 16:13:06,075 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 16:13:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:06,082 INFO L225 Difference]: With dead ends: 2797 [2018-12-03 16:13:06,082 INFO L226 Difference]: Without dead ends: 2789 [2018-12-03 16:13:06,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6228 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2936, Invalid=16246, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 16:13:06,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2018-12-03 16:13:07,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 1186. [2018-12-03 16:13:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-12-03 16:13:07,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2705 transitions. [2018-12-03 16:13:07,649 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2705 transitions. Word has length 16 [2018-12-03 16:13:07,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:07,650 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 2705 transitions. [2018-12-03 16:13:07,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:13:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2705 transitions. [2018-12-03 16:13:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:07,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:07,651 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:07,651 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:07,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:07,652 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-12-03 16:13:07,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:07,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:07,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:07,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:07,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:07,853 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:07,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:07,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:07,853 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:13:07,853 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [98], [115], [199], [203], [207], [236], [245], [260], [274], [349] [2018-12-03 16:13:07,854 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:07,855 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:07,867 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:07,867 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:07,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:07,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:07,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:07,873 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:07,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:07,881 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:07,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:08,129 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:08,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:08,300 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:08,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:08,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 16:13:08,319 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:08,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:13:08,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:13:08,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:13:08,320 INFO L87 Difference]: Start difference. First operand 1186 states and 2705 transitions. Second operand 17 states. [2018-12-03 16:13:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:19,263 INFO L93 Difference]: Finished difference Result 2492 states and 5544 transitions. [2018-12-03 16:13:19,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 16:13:19,263 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 16:13:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:19,270 INFO L225 Difference]: With dead ends: 2492 [2018-12-03 16:13:19,270 INFO L226 Difference]: Without dead ends: 2484 [2018-12-03 16:13:19,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4667 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2123, Invalid=12639, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:13:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2018-12-03 16:13:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1219. [2018-12-03 16:13:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-12-03 16:13:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2792 transitions. [2018-12-03 16:13:20,766 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2792 transitions. Word has length 16 [2018-12-03 16:13:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:20,766 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 2792 transitions. [2018-12-03 16:13:20,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:13:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2792 transitions. [2018-12-03 16:13:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:20,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:20,767 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:20,767 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:20,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:20,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-12-03 16:13:20,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:20,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:20,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:20,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:20,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:20,845 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:13:20,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:20,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:20,846 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:13:20,846 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [98], [179], [203], [217], [236], [245], [264], [274], [292], [298], [310], [349] [2018-12-03 16:13:20,847 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:20,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:20,866 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:20,866 INFO L272 AbstractInterpreter]: Visited 16 different actions 22 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:13:20,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:20,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:20,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:20,892 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:20,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:20,900 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:20,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:21,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:21,309 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:13:21,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [8] total 24 [2018-12-03 16:13:21,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:21,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:13:21,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:13:21,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:13:21,310 INFO L87 Difference]: Start difference. First operand 1219 states and 2792 transitions. Second operand 10 states. [2018-12-03 16:13:29,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:29,241 INFO L93 Difference]: Finished difference Result 2293 states and 5149 transitions. [2018-12-03 16:13:29,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:13:29,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-03 16:13:29,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:29,246 INFO L225 Difference]: With dead ends: 2293 [2018-12-03 16:13:29,246 INFO L226 Difference]: Without dead ends: 2285 [2018-12-03 16:13:29,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=491, Invalid=2479, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:13:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2018-12-03 16:13:30,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1390. [2018-12-03 16:13:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2018-12-03 16:13:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 3233 transitions. [2018-12-03 16:13:30,639 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 3233 transitions. Word has length 16 [2018-12-03 16:13:30,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:30,639 INFO L480 AbstractCegarLoop]: Abstraction has 1390 states and 3233 transitions. [2018-12-03 16:13:30,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:13:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 3233 transitions. [2018-12-03 16:13:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:30,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:30,640 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:30,640 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:30,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:30,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1212620139, now seen corresponding path program 1 times [2018-12-03 16:13:30,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:30,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:30,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:30,751 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:13:30,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:30,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:30,752 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:13:30,753 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [102], [179], [203], [217], [227], [236], [264], [274], [292], [298], [310], [349] [2018-12-03 16:13:30,754 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:30,755 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:30,771 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:30,772 INFO L272 AbstractInterpreter]: Visited 16 different actions 22 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:13:30,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:30,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:30,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:30,804 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:30,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:30,815 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:30,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:30,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:31,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:31,182 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:13:31,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [8] total 24 [2018-12-03 16:13:31,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:31,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:13:31,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:13:31,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:13:31,184 INFO L87 Difference]: Start difference. First operand 1390 states and 3233 transitions. Second operand 10 states. [2018-12-03 16:13:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:39,294 INFO L93 Difference]: Finished difference Result 2186 states and 4887 transitions. [2018-12-03 16:13:39,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:13:39,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-03 16:13:39,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:39,299 INFO L225 Difference]: With dead ends: 2186 [2018-12-03 16:13:39,299 INFO L226 Difference]: Without dead ends: 2178 [2018-12-03 16:13:39,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=597, Invalid=3063, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:13:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2018-12-03 16:13:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 1379. [2018-12-03 16:13:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1379 states. [2018-12-03 16:13:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 3204 transitions. [2018-12-03 16:13:41,020 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 3204 transitions. Word has length 16 [2018-12-03 16:13:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:41,020 INFO L480 AbstractCegarLoop]: Abstraction has 1379 states and 3204 transitions. [2018-12-03 16:13:41,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:13:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 3204 transitions. [2018-12-03 16:13:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:41,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:41,022 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:41,022 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:41,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:41,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-12-03 16:13:41,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:41,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:41,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:41,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:41,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:41,103 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:13:41,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:41,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:41,103 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:13:41,104 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [102], [179], [183], [203], [217], [229], [264], [274], [292], [298], [310], [349] [2018-12-03 16:13:41,105 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:41,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:41,122 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:41,122 INFO L272 AbstractInterpreter]: Visited 16 different actions 21 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:41,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:41,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:41,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:41,137 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:13:41,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:41,145 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:41,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:41,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:41,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:41,468 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:13:41,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [8] total 24 [2018-12-03 16:13:41,468 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:41,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:13:41,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:13:41,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:13:41,469 INFO L87 Difference]: Start difference. First operand 1379 states and 3204 transitions. Second operand 10 states. [2018-12-03 16:13:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:48,214 INFO L93 Difference]: Finished difference Result 1960 states and 4385 transitions. [2018-12-03 16:13:48,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:13:48,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-03 16:13:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:48,216 INFO L225 Difference]: With dead ends: 1960 [2018-12-03 16:13:48,217 INFO L226 Difference]: Without dead ends: 1952 [2018-12-03 16:13:48,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=436, Invalid=2320, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:13:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2018-12-03 16:13:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1392. [2018-12-03 16:13:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2018-12-03 16:13:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 3244 transitions. [2018-12-03 16:13:49,786 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 3244 transitions. Word has length 16 [2018-12-03 16:13:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:49,786 INFO L480 AbstractCegarLoop]: Abstraction has 1392 states and 3244 transitions. [2018-12-03 16:13:49,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:13:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 3244 transitions. [2018-12-03 16:13:49,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:13:49,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:49,787 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:49,788 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:49,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:49,788 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times [2018-12-03 16:13:49,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:49,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:49,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:49,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:49,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:49,864 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:49,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:49,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:49,864 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:13:49,865 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [92], [199], [203], [207], [236], [245], [254], [349] [2018-12-03 16:13:49,866 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:49,866 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:49,878 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:49,878 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:49,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:49,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:49,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:49,892 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:13:49,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:49,901 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:49,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:50,231 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:50,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:50,364 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:50,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:50,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 16:13:50,385 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:50,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:13:50,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:13:50,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:13:50,386 INFO L87 Difference]: Start difference. First operand 1392 states and 3244 transitions. Second operand 17 states. [2018-12-03 16:14:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:02,648 INFO L93 Difference]: Finished difference Result 2610 states and 5915 transitions. [2018-12-03 16:14:02,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 16:14:02,648 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 16:14:02,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:02,650 INFO L225 Difference]: With dead ends: 2610 [2018-12-03 16:14:02,651 INFO L226 Difference]: Without dead ends: 2602 [2018-12-03 16:14:02,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2983 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1805, Invalid=8701, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 16:14:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2018-12-03 16:14:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 1394. [2018-12-03 16:14:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2018-12-03 16:14:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 3250 transitions. [2018-12-03 16:14:04,207 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 3250 transitions. Word has length 16 [2018-12-03 16:14:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:04,207 INFO L480 AbstractCegarLoop]: Abstraction has 1394 states and 3250 transitions. [2018-12-03 16:14:04,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:14:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 3250 transitions. [2018-12-03 16:14:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:14:04,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:04,209 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:04,209 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:04,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:04,209 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times [2018-12-03 16:14:04,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:04,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:04,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:04,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:04,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:04,279 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:04,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:04,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:04,280 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:14:04,280 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [94], [98], [199], [203], [207], [236], [245], [349] [2018-12-03 16:14:04,281 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:14:04,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:14:04,292 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:14:04,292 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:04,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:04,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:14:04,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:04,301 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:04,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:04,310 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:04,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:04,552 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:04,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:04,693 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:04,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:04,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 16:14:04,713 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:04,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:14:04,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:14:04,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:14:04,714 INFO L87 Difference]: Start difference. First operand 1394 states and 3250 transitions. Second operand 17 states. [2018-12-03 16:14:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:18,292 INFO L93 Difference]: Finished difference Result 2988 states and 6781 transitions. [2018-12-03 16:14:18,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 16:14:18,292 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 16:14:18,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:18,296 INFO L225 Difference]: With dead ends: 2988 [2018-12-03 16:14:18,296 INFO L226 Difference]: Without dead ends: 2980 [2018-12-03 16:14:18,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3769 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2006, Invalid=10650, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 16:14:18,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2018-12-03 16:14:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 1474. [2018-12-03 16:14:20,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-12-03 16:14:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 3434 transitions. [2018-12-03 16:14:20,021 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 3434 transitions. Word has length 16 [2018-12-03 16:14:20,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:20,022 INFO L480 AbstractCegarLoop]: Abstraction has 1474 states and 3434 transitions. [2018-12-03 16:14:20,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:14:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 3434 transitions. [2018-12-03 16:14:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:14:20,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:20,023 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:20,023 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:20,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:20,023 INFO L82 PathProgramCache]: Analyzing trace with hash 714972923, now seen corresponding path program 1 times [2018-12-03 16:14:20,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:20,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:20,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:20,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:20,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:20,094 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:20,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:20,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:20,094 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:14:20,094 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [88], [98], [179], [203], [217], [236], [245], [292], [298], [310], [349] [2018-12-03 16:14:20,095 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:14:20,096 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:14:20,109 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:14:20,109 INFO L272 AbstractInterpreter]: Visited 16 different actions 22 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:14:20,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:20,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:14:20,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:20,116 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:20,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:20,124 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:20,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:20,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:20,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:20,479 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:14:20,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [8] total 24 [2018-12-03 16:14:20,480 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:14:20,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:14:20,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:14:20,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:14:20,481 INFO L87 Difference]: Start difference. First operand 1474 states and 3434 transitions. Second operand 10 states. [2018-12-03 16:14:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:29,230 INFO L93 Difference]: Finished difference Result 2474 states and 5589 transitions. [2018-12-03 16:14:29,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:14:29,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-03 16:14:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:29,233 INFO L225 Difference]: With dead ends: 2474 [2018-12-03 16:14:29,234 INFO L226 Difference]: Without dead ends: 2466 [2018-12-03 16:14:29,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=556, Invalid=2750, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:14:29,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2018-12-03 16:14:30,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 1583. [2018-12-03 16:14:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2018-12-03 16:14:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 3719 transitions. [2018-12-03 16:14:30,998 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 3719 transitions. Word has length 16 [2018-12-03 16:14:30,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:30,998 INFO L480 AbstractCegarLoop]: Abstraction has 1583 states and 3719 transitions. [2018-12-03 16:14:30,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:14:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 3719 transitions. [2018-12-03 16:14:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:14:30,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:30,999 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:31,000 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:31,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:31,000 INFO L82 PathProgramCache]: Analyzing trace with hash 715074789, now seen corresponding path program 1 times [2018-12-03 16:14:31,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:31,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:31,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:31,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:31,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:31,081 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:31,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:31,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:31,082 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:14:31,082 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [88], [102], [179], [203], [217], [227], [236], [292], [298], [310], [349] [2018-12-03 16:14:31,083 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:14:31,083 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:14:31,095 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:14:31,096 INFO L272 AbstractInterpreter]: Visited 16 different actions 22 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:14:31,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:31,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:14:31,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:31,111 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:31,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:31,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:31,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:31,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:31,423 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:14:31,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [8] total 24 [2018-12-03 16:14:31,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:14:31,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:14:31,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:14:31,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:14:31,424 INFO L87 Difference]: Start difference. First operand 1583 states and 3719 transitions. Second operand 10 states. [2018-12-03 16:14:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:40,119 INFO L93 Difference]: Finished difference Result 2352 states and 5291 transitions. [2018-12-03 16:14:40,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:14:40,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-03 16:14:40,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:40,123 INFO L225 Difference]: With dead ends: 2352 [2018-12-03 16:14:40,123 INFO L226 Difference]: Without dead ends: 2344 [2018-12-03 16:14:40,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=712, Invalid=3578, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:14:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2018-12-03 16:14:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 1572. [2018-12-03 16:14:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2018-12-03 16:14:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3690 transitions. [2018-12-03 16:14:42,195 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3690 transitions. Word has length 16 [2018-12-03 16:14:42,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:42,196 INFO L480 AbstractCegarLoop]: Abstraction has 1572 states and 3690 transitions. [2018-12-03 16:14:42,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:14:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3690 transitions. [2018-12-03 16:14:42,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:14:42,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:42,197 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:42,197 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:42,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:42,198 INFO L82 PathProgramCache]: Analyzing trace with hash 715075068, now seen corresponding path program 1 times [2018-12-03 16:14:42,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:42,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:42,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:42,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:42,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:42,303 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:42,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:42,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:42,304 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:14:42,304 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [88], [102], [179], [183], [203], [217], [229], [292], [298], [310], [349] [2018-12-03 16:14:42,305 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:14:42,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:14:42,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:14:42,317 INFO L272 AbstractInterpreter]: Visited 16 different actions 21 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:14:42,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:42,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:14:42,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:42,334 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:14:42,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:42,342 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:42,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:42,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:42,637 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:14:42,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [8] total 24 [2018-12-03 16:14:42,637 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:14:42,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:14:42,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:14:42,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:14:42,638 INFO L87 Difference]: Start difference. First operand 1572 states and 3690 transitions. Second operand 10 states. [2018-12-03 16:14:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:50,454 INFO L93 Difference]: Finished difference Result 2200 states and 4966 transitions. [2018-12-03 16:14:50,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:14:50,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-03 16:14:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:50,457 INFO L225 Difference]: With dead ends: 2200 [2018-12-03 16:14:50,458 INFO L226 Difference]: Without dead ends: 2192 [2018-12-03 16:14:50,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=528, Invalid=2664, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 16:14:50,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2018-12-03 16:14:52,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1409. [2018-12-03 16:14:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1409 states. [2018-12-03 16:14:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 3284 transitions. [2018-12-03 16:14:52,255 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 3284 transitions. Word has length 16 [2018-12-03 16:14:52,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:52,256 INFO L480 AbstractCegarLoop]: Abstraction has 1409 states and 3284 transitions. [2018-12-03 16:14:52,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:14:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 3284 transitions. [2018-12-03 16:14:52,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:14:52,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:52,257 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:52,257 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:52,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:52,257 INFO L82 PathProgramCache]: Analyzing trace with hash 876461633, now seen corresponding path program 1 times [2018-12-03 16:14:52,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:52,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:52,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:52,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:52,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:52,889 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:52,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:52,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:52,889 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:14:52,889 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [67], [72], [78], [98], [199], [203], [207], [236], [245], [292], [349] [2018-12-03 16:14:52,890 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:14:52,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:14:52,899 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:14:52,899 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:52,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:52,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:14:52,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:52,912 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:14:52,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:52,922 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:52,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:53,075 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:53,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:53,215 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:53,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:53,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 16:14:53,234 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:53,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:14:53,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:14:53,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:14:53,235 INFO L87 Difference]: Start difference. First operand 1409 states and 3284 transitions. Second operand 17 states. [2018-12-03 16:15:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:08,945 INFO L93 Difference]: Finished difference Result 2816 states and 6400 transitions. [2018-12-03 16:15:08,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:15:08,945 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 16:15:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:08,949 INFO L225 Difference]: With dead ends: 2816 [2018-12-03 16:15:08,949 INFO L226 Difference]: Without dead ends: 2808 [2018-12-03 16:15:08,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2779 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1562, Invalid=7944, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:15:08,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2018-12-03 16:15:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 1325. [2018-12-03 16:15:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2018-12-03 16:15:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 3094 transitions. [2018-12-03 16:15:10,581 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 3094 transitions. Word has length 16 [2018-12-03 16:15:10,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:10,581 INFO L480 AbstractCegarLoop]: Abstraction has 1325 states and 3094 transitions. [2018-12-03 16:15:10,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:15:10,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 3094 transitions. [2018-12-03 16:15:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:15:10,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:10,582 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:15:10,582 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:10,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:10,583 INFO L82 PathProgramCache]: Analyzing trace with hash -688951426, now seen corresponding path program 1 times [2018-12-03 16:15:10,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:10,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:10,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:10,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:10,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:10,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:15:10,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 16:15:10,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:15:10,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:15:10,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:15:10,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:15:10,651 INFO L87 Difference]: Start difference. First operand 1325 states and 3094 transitions. Second operand 9 states. [2018-12-03 16:15:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:16,031 INFO L93 Difference]: Finished difference Result 1894 states and 4354 transitions. [2018-12-03 16:15:16,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:15:16,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 16:15:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:16,034 INFO L225 Difference]: With dead ends: 1894 [2018-12-03 16:15:16,034 INFO L226 Difference]: Without dead ends: 1886 [2018-12-03 16:15:16,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:15:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2018-12-03 16:15:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1302. [2018-12-03 16:15:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1302 states. [2018-12-03 16:15:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 3023 transitions. [2018-12-03 16:15:17,637 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 3023 transitions. Word has length 16 [2018-12-03 16:15:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:17,637 INFO L480 AbstractCegarLoop]: Abstraction has 1302 states and 3023 transitions. [2018-12-03 16:15:17,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:15:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 3023 transitions. [2018-12-03 16:15:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:15:17,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:17,638 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:15:17,638 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:17,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:17,639 INFO L82 PathProgramCache]: Analyzing trace with hash -688849281, now seen corresponding path program 1 times [2018-12-03 16:15:17,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:17,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:17,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:17,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:17,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:17,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:15:17,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 16:15:17,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:15:17,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:15:17,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:15:17,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:15:17,720 INFO L87 Difference]: Start difference. First operand 1302 states and 3023 transitions. Second operand 9 states. [2018-12-03 16:15:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:22,532 INFO L93 Difference]: Finished difference Result 1676 states and 3773 transitions. [2018-12-03 16:15:22,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:15:22,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 16:15:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:22,534 INFO L225 Difference]: With dead ends: 1676 [2018-12-03 16:15:22,534 INFO L226 Difference]: Without dead ends: 1668 [2018-12-03 16:15:22,535 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:15:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2018-12-03 16:15:24,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1300. [2018-12-03 16:15:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-12-03 16:15:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3016 transitions. [2018-12-03 16:15:24,263 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3016 transitions. Word has length 16 [2018-12-03 16:15:24,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:24,263 INFO L480 AbstractCegarLoop]: Abstraction has 1300 states and 3016 transitions. [2018-12-03 16:15:24,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:15:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3016 transitions. [2018-12-03 16:15:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:15:24,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:24,264 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:15:24,264 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:24,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:24,265 INFO L82 PathProgramCache]: Analyzing trace with hash -679935045, now seen corresponding path program 1 times [2018-12-03 16:15:24,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:24,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:24,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:24,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:24,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:24,655 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:15:24,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:24,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:24,655 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:15:24,655 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [67], [72], [78], [174], [179], [183], [203], [217], [298], [310], [349] [2018-12-03 16:15:24,656 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:15:24,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:15:24,666 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:15:24,666 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:15:24,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:24,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:15:24,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:24,672 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:24,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:24,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:24,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:24,900 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:15:24,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:25,203 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:15:25,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:25,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 25 [2018-12-03 16:15:25,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:25,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:15:25,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:15:25,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:15:25,224 INFO L87 Difference]: Start difference. First operand 1300 states and 3016 transitions. Second operand 18 states. [2018-12-03 16:15:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:39,304 INFO L93 Difference]: Finished difference Result 2025 states and 4585 transitions. [2018-12-03 16:15:39,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:15:39,305 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-12-03 16:15:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:39,307 INFO L225 Difference]: With dead ends: 2025 [2018-12-03 16:15:39,307 INFO L226 Difference]: Without dead ends: 2017 [2018-12-03 16:15:39,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2462 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1473, Invalid=7457, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 16:15:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2018-12-03 16:15:40,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 1069. [2018-12-03 16:15:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-12-03 16:15:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 2444 transitions. [2018-12-03 16:15:40,690 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 2444 transitions. Word has length 16 [2018-12-03 16:15:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:40,690 INFO L480 AbstractCegarLoop]: Abstraction has 1069 states and 2444 transitions. [2018-12-03 16:15:40,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:15:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2444 transitions. [2018-12-03 16:15:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:15:40,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:40,692 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:15:40,692 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:40,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:40,692 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-12-03 16:15:40,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:40,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:40,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:40,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:40,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:40,852 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:40,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:40,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:40,853 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:15:40,853 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [92], [199], [203], [207], [236], [245], [254], [337], [345], [351] [2018-12-03 16:15:40,854 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:15:40,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:15:40,861 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:15:40,862 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:15:40,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:40,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:15:40,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:40,902 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:40,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:40,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:40,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:40,920 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:40,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:40,946 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:40,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:40,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:15:40,966 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:40,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:15:40,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:15:40,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:15:40,967 INFO L87 Difference]: Start difference. First operand 1069 states and 2444 transitions. Second operand 8 states. [2018-12-03 16:15:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:44,820 INFO L93 Difference]: Finished difference Result 1522 states and 3375 transitions. [2018-12-03 16:15:44,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:15:44,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:15:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:44,823 INFO L225 Difference]: With dead ends: 1522 [2018-12-03 16:15:44,823 INFO L226 Difference]: Without dead ends: 1514 [2018-12-03 16:15:44,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:15:44,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-12-03 16:15:46,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1225. [2018-12-03 16:15:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-12-03 16:15:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 2809 transitions. [2018-12-03 16:15:46,360 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 2809 transitions. Word has length 16 [2018-12-03 16:15:46,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:46,361 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 2809 transitions. [2018-12-03 16:15:46,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:15:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2809 transitions. [2018-12-03 16:15:46,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:15:46,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:46,361 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:15:46,362 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:46,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:46,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-12-03 16:15:46,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:46,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:46,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:46,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:46,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:46,421 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:15:46,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:46,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:46,422 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:15:46,422 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [94], [102], [186], [192], [203], [227], [229], [236], [337], [345], [351] [2018-12-03 16:15:46,423 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:15:46,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:15:46,432 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:15:46,432 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:15:46,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:46,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:15:46,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:46,465 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:46,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:46,475 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:46,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:46,486 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:15:46,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:46,525 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:15:46,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:46,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:15:46,545 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:46,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:15:46,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:15:46,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:15:46,546 INFO L87 Difference]: Start difference. First operand 1225 states and 2809 transitions. Second operand 8 states. [2018-12-03 16:15:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:50,480 INFO L93 Difference]: Finished difference Result 1661 states and 3674 transitions. [2018-12-03 16:15:50,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:15:50,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:15:50,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:50,482 INFO L225 Difference]: With dead ends: 1661 [2018-12-03 16:15:50,483 INFO L226 Difference]: Without dead ends: 1653 [2018-12-03 16:15:50,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:15:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-12-03 16:15:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1237. [2018-12-03 16:15:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2018-12-03 16:15:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2833 transitions. [2018-12-03 16:15:52,172 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2833 transitions. Word has length 16 [2018-12-03 16:15:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:52,172 INFO L480 AbstractCegarLoop]: Abstraction has 1237 states and 2833 transitions. [2018-12-03 16:15:52,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:15:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2833 transitions. [2018-12-03 16:15:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:15:52,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:52,173 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:15:52,173 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:52,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:52,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times [2018-12-03 16:15:52,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:52,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:52,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:52,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:52,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:52,254 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,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:52,255 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:52,255 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:15:52,255 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [94], [102], [183], [186], [192], [203], [229], [337], [345], [351] [2018-12-03 16:15:52,256 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:15:52,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:15:52,263 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:15:52,263 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:15:52,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:52,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:15:52,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:52,274 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:15:52,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:52,284 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:52,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:52,294 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,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:52,337 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,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:52,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:15:52,357 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:52,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:15:52,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:15:52,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:15:52,357 INFO L87 Difference]: Start difference. First operand 1237 states and 2833 transitions. Second operand 8 states. [2018-12-03 16:15:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:56,963 INFO L93 Difference]: Finished difference Result 1772 states and 3936 transitions. [2018-12-03 16:15:56,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:15:56,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:15:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:56,966 INFO L225 Difference]: With dead ends: 1772 [2018-12-03 16:15:56,966 INFO L226 Difference]: Without dead ends: 1764 [2018-12-03 16:15:56,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:15:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-12-03 16:15:58,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1318. [2018-12-03 16:15:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2018-12-03 16:15:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 3019 transitions. [2018-12-03 16:15:58,607 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 3019 transitions. Word has length 16 [2018-12-03 16:15:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:58,607 INFO L480 AbstractCegarLoop]: Abstraction has 1318 states and 3019 transitions. [2018-12-03 16:15:58,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:15:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 3019 transitions. [2018-12-03 16:15:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:15:58,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:58,608 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:15:58,608 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:58,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:58,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-12-03 16:15:58,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:58,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:58,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:58,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:58,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:58,688 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:15:58,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:58,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:58,689 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:15:58,689 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [78], [203], [213], [227], [236], [277], [279], [286], [337], [345], [351] [2018-12-03 16:15:58,690 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:15:58,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:15:58,700 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:15:58,700 INFO L272 AbstractInterpreter]: Visited 15 different actions 21 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:15:58,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:58,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:15:58,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:58,725 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:15:58,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:58,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:58,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:58,743 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:15:58,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:58,795 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:15:58,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:58,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:15:58,814 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:58,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:15:58,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:15:58,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:15:58,815 INFO L87 Difference]: Start difference. First operand 1318 states and 3019 transitions. Second operand 8 states. [2018-12-03 16:16:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:03,004 INFO L93 Difference]: Finished difference Result 1789 states and 3956 transitions. [2018-12-03 16:16:03,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:16:03,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:16:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:03,006 INFO L225 Difference]: With dead ends: 1789 [2018-12-03 16:16:03,007 INFO L226 Difference]: Without dead ends: 1781 [2018-12-03 16:16:03,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:16:03,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2018-12-03 16:16:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1345. [2018-12-03 16:16:04,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-12-03 16:16:04,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 3076 transitions. [2018-12-03 16:16:04,702 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 3076 transitions. Word has length 16 [2018-12-03 16:16:04,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:04,702 INFO L480 AbstractCegarLoop]: Abstraction has 1345 states and 3076 transitions. [2018-12-03 16:16:04,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:16:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 3076 transitions. [2018-12-03 16:16:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:16:04,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:04,703 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:16:04,703 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:04,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:04,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1133347051, now seen corresponding path program 1 times [2018-12-03 16:16:04,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:04,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:04,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:04,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:04,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:04,781 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:04,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:04,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:04,781 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:16:04,781 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [78], [183], [203], [213], [229], [277], [279], [286], [337], [345], [351] [2018-12-03 16:16:04,782 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:16:04,782 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:16:04,791 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:16:04,791 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:16:04,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:04,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:16:04,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:04,798 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:04,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:04,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:16:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:04,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:04,816 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:04,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:04,855 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:04,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:04,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:16:04,875 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:04,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:16:04,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:16:04,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:16:04,876 INFO L87 Difference]: Start difference. First operand 1345 states and 3076 transitions. Second operand 8 states. [2018-12-03 16:16:10,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:10,088 INFO L93 Difference]: Finished difference Result 2013 states and 4457 transitions. [2018-12-03 16:16:10,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:16:10,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:16:10,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:10,091 INFO L225 Difference]: With dead ends: 2013 [2018-12-03 16:16:10,091 INFO L226 Difference]: Without dead ends: 2005 [2018-12-03 16:16:10,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:16:10,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2018-12-03 16:16:11,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1324. [2018-12-03 16:16:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2018-12-03 16:16:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 3031 transitions. [2018-12-03 16:16:11,753 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 3031 transitions. Word has length 16 [2018-12-03 16:16:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:11,753 INFO L480 AbstractCegarLoop]: Abstraction has 1324 states and 3031 transitions. [2018-12-03 16:16:11,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:16:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 3031 transitions. [2018-12-03 16:16:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:16:11,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:11,754 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:16:11,754 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:11,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:11,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1137226608, now seen corresponding path program 1 times [2018-12-03 16:16:11,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:11,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:11,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:11,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:11,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:12,192 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:12,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:12,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:12,192 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:16:12,193 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [78], [174], [183], [203], [279], [283], [286], [337], [345], [351] [2018-12-03 16:16:12,193 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:16:12,194 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:16:12,199 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:16:12,200 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:16:12,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:12,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:16:12,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:12,209 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:12,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:12,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:16:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:12,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:12,227 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:12,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:12,258 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:12,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:12,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:16:12,277 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:12,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:16:12,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:16:12,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:16:12,278 INFO L87 Difference]: Start difference. First operand 1324 states and 3031 transitions. Second operand 8 states. [2018-12-03 16:16:17,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:17,170 INFO L93 Difference]: Finished difference Result 1884 states and 4184 transitions. [2018-12-03 16:16:17,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:16:17,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:16:17,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:17,173 INFO L225 Difference]: With dead ends: 1884 [2018-12-03 16:16:17,173 INFO L226 Difference]: Without dead ends: 1876 [2018-12-03 16:16:17,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:16:17,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2018-12-03 16:16:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1338. [2018-12-03 16:16:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2018-12-03 16:16:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 3063 transitions. [2018-12-03 16:16:19,065 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 3063 transitions. Word has length 16 [2018-12-03 16:16:19,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:19,065 INFO L480 AbstractCegarLoop]: Abstraction has 1338 states and 3063 transitions. [2018-12-03 16:16:19,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:16:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 3063 transitions. [2018-12-03 16:16:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:16:19,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:19,066 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:16:19,066 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:19,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:19,066 INFO L82 PathProgramCache]: Analyzing trace with hash 918935888, now seen corresponding path program 1 times [2018-12-03 16:16:19,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:19,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:19,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:19,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:19,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:19,162 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:19,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:19,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:19,163 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:16:19,164 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [203], [213], [227], [236], [277], [317], [321], [323], [331], [339], [345], [351] [2018-12-03 16:16:19,165 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:16:19,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:16:19,174 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:16:19,174 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:16:19,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:19,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:16:19,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:19,215 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:19,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:19,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:16:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:19,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:19,240 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:19,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:19,266 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:19,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:19,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:16:19,288 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:19,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:16:19,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:16:19,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:16:19,288 INFO L87 Difference]: Start difference. First operand 1338 states and 3063 transitions. Second operand 8 states. [2018-12-03 16:16:23,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:23,141 INFO L93 Difference]: Finished difference Result 1644 states and 3666 transitions. [2018-12-03 16:16:23,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:16:23,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:16:23,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:23,144 INFO L225 Difference]: With dead ends: 1644 [2018-12-03 16:16:23,144 INFO L226 Difference]: Without dead ends: 1636 [2018-12-03 16:16:23,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:16:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2018-12-03 16:16:25,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1321. [2018-12-03 16:16:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2018-12-03 16:16:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 3020 transitions. [2018-12-03 16:16:25,036 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 3020 transitions. Word has length 16 [2018-12-03 16:16:25,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:25,037 INFO L480 AbstractCegarLoop]: Abstraction has 1321 states and 3020 transitions. [2018-12-03 16:16:25,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:16:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 3020 transitions. [2018-12-03 16:16:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:16:25,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:25,037 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:16:25,038 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:25,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:25,038 INFO L82 PathProgramCache]: Analyzing trace with hash 918936167, now seen corresponding path program 1 times [2018-12-03 16:16:25,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:25,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:25,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:25,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:25,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:25,125 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:25,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:25,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:25,125 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:16:25,125 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [183], [203], [213], [229], [277], [317], [321], [323], [331], [339], [345], [351] [2018-12-03 16:16:25,126 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:16:25,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:16:25,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:16:25,134 INFO L272 AbstractInterpreter]: Visited 15 different actions 21 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:16:25,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:25,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:16:25,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:25,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:16:25,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:25,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:16:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:25,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:25,159 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:25,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:25,195 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:25,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:25,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:16:25,214 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:25,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:16:25,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:16:25,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:16:25,214 INFO L87 Difference]: Start difference. First operand 1321 states and 3020 transitions. Second operand 8 states. [2018-12-03 16:16:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:30,014 INFO L93 Difference]: Finished difference Result 1868 states and 4167 transitions. [2018-12-03 16:16:30,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:16:30,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:16:30,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:30,017 INFO L225 Difference]: With dead ends: 1868 [2018-12-03 16:16:30,017 INFO L226 Difference]: Without dead ends: 1860 [2018-12-03 16:16:30,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:16:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2018-12-03 16:16:31,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1300. [2018-12-03 16:16:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-12-03 16:16:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 2975 transitions. [2018-12-03 16:16:31,840 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 2975 transitions. Word has length 16 [2018-12-03 16:16:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:31,840 INFO L480 AbstractCegarLoop]: Abstraction has 1300 states and 2975 transitions. [2018-12-03 16:16:31,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:16:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2975 transitions. [2018-12-03 16:16:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:16:31,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:31,841 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:16:31,841 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:31,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:31,842 INFO L82 PathProgramCache]: Analyzing trace with hash 922815724, now seen corresponding path program 1 times [2018-12-03 16:16:31,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:31,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:31,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:31,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:31,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:31,914 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:31,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:31,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:31,915 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:16:31,915 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [174], [183], [203], [279], [283], [317], [321], [323], [331], [339], [345], [351] [2018-12-03 16:16:31,917 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:16:31,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:16:31,924 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:16:31,924 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:16:31,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:31,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:16:31,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:31,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:16:31,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:31,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:16:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:31,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:31,950 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:31,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:31,981 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:32,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:32,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:16:32,000 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:32,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:16:32,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:16:32,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:16:32,001 INFO L87 Difference]: Start difference. First operand 1300 states and 2975 transitions. Second operand 8 states. [2018-12-03 16:16:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:37,116 INFO L93 Difference]: Finished difference Result 1963 states and 4379 transitions. [2018-12-03 16:16:37,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:16:37,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:16:37,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:37,120 INFO L225 Difference]: With dead ends: 1963 [2018-12-03 16:16:37,120 INFO L226 Difference]: Without dead ends: 1955 [2018-12-03 16:16:37,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:16:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2018-12-03 16:16:38,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1294. [2018-12-03 16:16:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2018-12-03 16:16:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 2963 transitions. [2018-12-03 16:16:38,876 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 2963 transitions. Word has length 16 [2018-12-03 16:16:38,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:38,876 INFO L480 AbstractCegarLoop]: Abstraction has 1294 states and 2963 transitions. [2018-12-03 16:16:38,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:16:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2963 transitions. [2018-12-03 16:16:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:16:38,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:38,878 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:16:38,878 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:38,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:38,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1012397261, now seen corresponding path program 1 times [2018-12-03 16:16:38,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:38,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:38,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:38,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:38,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:38,936 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:38,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:38,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:38,936 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 16:16:38,937 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [174], [183], [203], [283], [314], [317], [323], [331], [339], [345], [351] [2018-12-03 16:16:38,937 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:16:38,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:16:38,949 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:16:38,950 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:16:38,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:38,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:16:38,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:38,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 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:16:38,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:38,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:16:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:39,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:39,014 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:39,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:39,051 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:39,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:39,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:16:39,069 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:39,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:16:39,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:16:39,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:16:39,070 INFO L87 Difference]: Start difference. First operand 1294 states and 2963 transitions. Second operand 8 states. [2018-12-03 16:16:43,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:43,012 INFO L93 Difference]: Finished difference Result 1586 states and 3547 transitions. [2018-12-03 16:16:43,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:16:43,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 16:16:43,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:43,014 INFO L225 Difference]: With dead ends: 1586 [2018-12-03 16:16:43,014 INFO L226 Difference]: Without dead ends: 1578 [2018-12-03 16:16:43,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 6 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:16:43,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2018-12-03 16:16:44,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1230. [2018-12-03 16:16:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2018-12-03 16:16:44,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2809 transitions. [2018-12-03 16:16:44,744 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2809 transitions. Word has length 16 [2018-12-03 16:16:44,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:44,744 INFO L480 AbstractCegarLoop]: Abstraction has 1230 states and 2809 transitions. [2018-12-03 16:16:44,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:16:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2809 transitions. [2018-12-03 16:16:44,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:16:44,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:44,745 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:16:44,745 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:44,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:44,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1223690942, now seen corresponding path program 1 times [2018-12-03 16:16:44,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:44,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:44,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:44,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:44,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:44,842 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:16:44,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:44,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:44,842 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-12-03 16:16:44,842 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:44,843 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:16:44,843 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:16:44,855 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:16:44,856 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:44,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:44,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:16:44,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:44,866 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:16:44,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:44,874 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:16:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:44,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:45,005 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:16:45,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:45,098 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:16:45,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:45,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2018-12-03 16:16:45,117 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:45,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:16:45,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:16:45,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:16:45,118 INFO L87 Difference]: Start difference. First operand 1230 states and 2809 transitions. Second operand 18 states. [2018-12-03 16:16:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:58,741 INFO L93 Difference]: Finished difference Result 3844 states and 8615 transitions. [2018-12-03 16:16:58,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:16:58,742 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 16:16:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:58,747 INFO L225 Difference]: With dead ends: 3844 [2018-12-03 16:16:58,747 INFO L226 Difference]: Without dead ends: 3836 [2018-12-03 16:16:58,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2645 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1981, Invalid=6575, Unknown=0, NotChecked=0, Total=8556 [2018-12-03 16:16:58,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3836 states. [2018-12-03 16:17:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3836 to 2181. [2018-12-03 16:17:02,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2181 states. [2018-12-03 16:17:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 5032 transitions. [2018-12-03 16:17:02,076 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 5032 transitions. Word has length 17 [2018-12-03 16:17:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:02,076 INFO L480 AbstractCegarLoop]: Abstraction has 2181 states and 5032 transitions. [2018-12-03 16:17:02,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:17:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 5032 transitions. [2018-12-03 16:17:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:17:02,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:02,077 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:17:02,077 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:02,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:02,078 INFO L82 PathProgramCache]: Analyzing trace with hash 523391216, now seen corresponding path program 1 times [2018-12-03 16:17:02,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:02,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:02,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:02,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:02,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:02,249 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:17:02,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:02,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:17:02,250 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:17:02,250 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [92], [94], [102], [104], [110], [115], [186], [192], [203], [229], [236], [245], [254], [260], [274], [349] [2018-12-03 16:17:02,251 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:17:02,251 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:17:02,261 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:17:02,261 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:17:02,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:02,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:17:02,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:02,274 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:17:02,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:02,283 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:17:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:02,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:17:02,515 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:17:02,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:17:02,950 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:17:02,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:17:02,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2018-12-03 16:17:02,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:17:02,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:17:02,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:17:02,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:17:02,970 INFO L87 Difference]: Start difference. First operand 2181 states and 5032 transitions. Second operand 14 states. [2018-12-03 16:17:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:19,619 INFO L93 Difference]: Finished difference Result 5886 states and 13337 transitions. [2018-12-03 16:17:19,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:17:19,619 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 16:17:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:19,627 INFO L225 Difference]: With dead ends: 5886 [2018-12-03 16:17:19,627 INFO L226 Difference]: Without dead ends: 5878 [2018-12-03 16:17:19,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1131, Invalid=3981, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:17:19,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2018-12-03 16:17:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 3157. [2018-12-03 16:17:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3157 states. [2018-12-03 16:17:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 7416 transitions. [2018-12-03 16:17:24,285 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 7416 transitions. Word has length 20 [2018-12-03 16:17:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:24,285 INFO L480 AbstractCegarLoop]: Abstraction has 3157 states and 7416 transitions. [2018-12-03 16:17:24,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:17:24,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 7416 transitions. [2018-12-03 16:17:24,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:17:24,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:24,287 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:17:24,287 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:24,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:24,287 INFO L82 PathProgramCache]: Analyzing trace with hash 520590862, now seen corresponding path program 1 times [2018-12-03 16:17:24,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:24,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:24,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:24,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:24,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:24,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:24,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:17:24,400 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:17:24,400 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [98], [102], [104], [110], [115], [186], [192], [203], [229], [236], [245], [260], [274], [349] [2018-12-03 16:17:24,400 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:17:24,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:17:24,409 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:17:24,410 INFO L272 AbstractInterpreter]: Visited 18 different actions 27 times. Merged at 7 different actions 7 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 16:17:24,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:24,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:17:24,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:24,441 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:17:24,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:24,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:17:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:24,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:17:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:17:25,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:17:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:17:25,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:17:25,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2018-12-03 16:17:25,276 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:17:25,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:17:25,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:17:25,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:17:25,276 INFO L87 Difference]: Start difference. First operand 3157 states and 7416 transitions. Second operand 14 states. [2018-12-03 16:17:34,038 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 16:17:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:42,405 INFO L93 Difference]: Finished difference Result 5901 states and 13371 transitions. [2018-12-03 16:17:42,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:17:42,405 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 16:17:42,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:42,412 INFO L225 Difference]: With dead ends: 5901 [2018-12-03 16:17:42,412 INFO L226 Difference]: Without dead ends: 5893 [2018-12-03 16:17:42,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1033, Invalid=3523, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:17:42,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2018-12-03 16:17:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 3101. [2018-12-03 16:17:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3101 states. [2018-12-03 16:17:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 7261 transitions. [2018-12-03 16:17:47,426 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 7261 transitions. Word has length 20 [2018-12-03 16:17:47,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:47,426 INFO L480 AbstractCegarLoop]: Abstraction has 3101 states and 7261 transitions. [2018-12-03 16:17:47,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:17:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 7261 transitions. [2018-12-03 16:17:47,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:17:47,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:47,427 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:17:47,428 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:47,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:47,428 INFO L82 PathProgramCache]: Analyzing trace with hash 520693007, now seen corresponding path program 1 times [2018-12-03 16:17:47,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:47,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:47,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:47,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:47,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:47,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:47,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:17:47,584 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:17:47,584 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [102], [104], [110], [115], [183], [186], [192], [203], [229], [260], [274], [349] [2018-12-03 16:17:47,584 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:17:47,585 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:17:47,601 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:17:47,601 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:17:47,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:47,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:17:47,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:47,639 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:17:47,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:47,658 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:17:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:47,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:17:47,742 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:17:47,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:17:47,827 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:17:47,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:17:47,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2018-12-03 16:17:47,846 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:17:47,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:17:47,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:17:47,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:17:47,847 INFO L87 Difference]: Start difference. First operand 3101 states and 7261 transitions. Second operand 14 states. [2018-12-03 16:18:03,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:03,275 INFO L93 Difference]: Finished difference Result 5075 states and 11387 transitions. [2018-12-03 16:18:03,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:18:03,276 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 16:18:03,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:03,281 INFO L225 Difference]: With dead ends: 5075 [2018-12-03 16:18:03,282 INFO L226 Difference]: Without dead ends: 5067 [2018-12-03 16:18:03,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=730, Invalid=2240, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:18:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2018-12-03 16:18:08,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 3178. [2018-12-03 16:18:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2018-12-03 16:18:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 7413 transitions. [2018-12-03 16:18:08,209 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 7413 transitions. Word has length 20 [2018-12-03 16:18:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:08,209 INFO L480 AbstractCegarLoop]: Abstraction has 3178 states and 7413 transitions. [2018-12-03 16:18:08,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:18:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 7413 transitions. [2018-12-03 16:18:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:18:08,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:08,210 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:18:08,211 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:08,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash -740478461, now seen corresponding path program 1 times [2018-12-03 16:18:08,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:08,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:08,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:08,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:08,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:08,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:08,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:18:08,595 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:18:08,595 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [92], [94], [102], [104], [110], [115], [186], [192], [203], [229], [236], [245], [254], [349] [2018-12-03 16:18:08,596 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:18:08,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:18:08,605 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:18:08,605 INFO L272 AbstractInterpreter]: Visited 20 different actions 30 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:18:08,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:08,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:18:08,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:08,635 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:18:08,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:08,643 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:18:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:08,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:18:08,721 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:18:08,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:18:08,954 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:18:08,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:18:08,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 16:18:08,974 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:18:08,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:18:08,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:18:08,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:18:08,975 INFO L87 Difference]: Start difference. First operand 3178 states and 7413 transitions. Second operand 14 states. [2018-12-03 16:18:14,374 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-03 16:18:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:26,382 INFO L93 Difference]: Finished difference Result 5795 states and 13131 transitions. [2018-12-03 16:18:26,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:18:26,382 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 16:18:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:26,389 INFO L225 Difference]: With dead ends: 5795 [2018-12-03 16:18:26,389 INFO L226 Difference]: Without dead ends: 5787 [2018-12-03 16:18:26,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=694, Invalid=2846, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:18:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5787 states. [2018-12-03 16:18:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5787 to 3418. [2018-12-03 16:18:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3418 states. [2018-12-03 16:18:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 7942 transitions. [2018-12-03 16:18:31,801 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 7942 transitions. Word has length 20 [2018-12-03 16:18:31,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:31,802 INFO L480 AbstractCegarLoop]: Abstraction has 3418 states and 7942 transitions. [2018-12-03 16:18:31,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:18:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 7942 transitions. [2018-12-03 16:18:31,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:18:31,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:31,803 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:18:31,803 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:31,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:31,803 INFO L82 PathProgramCache]: Analyzing trace with hash -743278815, now seen corresponding path program 1 times [2018-12-03 16:18:31,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:31,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:31,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:31,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:31,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:31,891 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:18:31,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:31,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:18:31,892 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:18:31,892 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [94], [98], [102], [104], [110], [115], [186], [192], [203], [229], [236], [245], [349] [2018-12-03 16:18:31,893 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:18:31,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:18:31,901 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:18:31,901 INFO L272 AbstractInterpreter]: Visited 19 different actions 28 times. Merged at 7 different actions 7 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 16:18:31,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:31,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:18:31,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:31,924 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:18:31,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:31,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:18:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:31,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:18:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:18:31,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:18:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:18:32,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:18:32,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 16:18:32,120 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:18:32,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:18:32,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:18:32,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:18:32,120 INFO L87 Difference]: Start difference. First operand 3418 states and 7942 transitions. Second operand 14 states. [2018-12-03 16:18:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:48,516 INFO L93 Difference]: Finished difference Result 5717 states and 12951 transitions. [2018-12-03 16:18:48,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:18:48,516 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 16:18:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:48,522 INFO L225 Difference]: With dead ends: 5717 [2018-12-03 16:18:48,523 INFO L226 Difference]: Without dead ends: 5709 [2018-12-03 16:18:48,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=652, Invalid=2540, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 16:18:48,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5709 states. [2018-12-03 16:18:53,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5709 to 3401. [2018-12-03 16:18:53,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2018-12-03 16:18:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 7902 transitions. [2018-12-03 16:18:53,993 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 7902 transitions. Word has length 20 [2018-12-03 16:18:53,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:53,994 INFO L480 AbstractCegarLoop]: Abstraction has 3401 states and 7902 transitions. [2018-12-03 16:18:53,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:18:53,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 7902 transitions. [2018-12-03 16:18:53,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:18:53,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:53,995 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:18:53,995 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:53,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:53,995 INFO L82 PathProgramCache]: Analyzing trace with hash -743176670, now seen corresponding path program 1 times [2018-12-03 16:18:53,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:53,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:53,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:53,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:53,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:54,091 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:18:54,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:54,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:18:54,091 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:18:54,091 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [94], [102], [104], [110], [115], [183], [186], [192], [203], [229], [349] [2018-12-03 16:18:54,092 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:18:54,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:18:54,100 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:18:54,100 INFO L272 AbstractInterpreter]: Visited 17 different actions 23 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:18:54,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:54,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:18:54,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:54,116 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:18:54,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:54,125 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:18:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:54,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:18:54,191 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:18:54,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:18:54,314 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:18:54,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:18:54,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 16:18:54,333 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:18:54,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:18:54,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:18:54,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:18:54,334 INFO L87 Difference]: Start difference. First operand 3401 states and 7902 transitions. Second operand 14 states. [2018-12-03 16:19:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:08,565 INFO L93 Difference]: Finished difference Result 4907 states and 11065 transitions. [2018-12-03 16:19:08,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:19:08,565 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 16:19:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:08,571 INFO L225 Difference]: With dead ends: 4907 [2018-12-03 16:19:08,572 INFO L226 Difference]: Without dead ends: 4899 [2018-12-03 16:19:08,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=403, Invalid=1489, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:19:08,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2018-12-03 16:19:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 3264. [2018-12-03 16:19:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3264 states. [2018-12-03 16:19:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 7570 transitions. [2018-12-03 16:19:14,294 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 7570 transitions. Word has length 20 [2018-12-03 16:19:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:14,294 INFO L480 AbstractCegarLoop]: Abstraction has 3264 states and 7570 transitions. [2018-12-03 16:19:14,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:19:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 7570 transitions. [2018-12-03 16:19:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:19:14,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:14,296 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:19:14,296 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:14,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:14,296 INFO L82 PathProgramCache]: Analyzing trace with hash -245402134, now seen corresponding path program 1 times [2018-12-03 16:19:14,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:14,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:14,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:14,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:14,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:19:14,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:14,383 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:19:14,383 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:19:14,383 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [61], [67], [72], [76], [78], [84], [92], [203], [236], [245], [254], [279], [286], [349] [2018-12-03 16:19:14,384 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:19:14,384 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:19:14,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:19:14,394 INFO L272 AbstractInterpreter]: Visited 18 different actions 30 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:19:14,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:14,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:19:14,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:14,403 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:19:14,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:14,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:19:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:14,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:19:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:19:14,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:19:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:19:14,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:19:14,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 16:19:14,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:19:14,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:19:14,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:19:14,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:19:14,558 INFO L87 Difference]: Start difference. First operand 3264 states and 7570 transitions. Second operand 11 states. [2018-12-03 16:19:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:24,405 INFO L93 Difference]: Finished difference Result 3785 states and 8617 transitions. [2018-12-03 16:19:24,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:19:24,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:19:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:24,410 INFO L225 Difference]: With dead ends: 3785 [2018-12-03 16:19:24,410 INFO L226 Difference]: Without dead ends: 3777 [2018-12-03 16:19:24,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=342, Invalid=918, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:19:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2018-12-03 16:19:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3318. [2018-12-03 16:19:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3318 states. [2018-12-03 16:19:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 7706 transitions. [2018-12-03 16:19:30,075 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 7706 transitions. Word has length 20 [2018-12-03 16:19:30,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:30,075 INFO L480 AbstractCegarLoop]: Abstraction has 3318 states and 7706 transitions. [2018-12-03 16:19:30,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:19:30,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 7706 transitions. [2018-12-03 16:19:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:19:30,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:30,077 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:19:30,077 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:30,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:30,077 INFO L82 PathProgramCache]: Analyzing trace with hash -248202488, now seen corresponding path program 1 times [2018-12-03 16:19:30,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:30,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:30,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:30,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:30,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:19:30,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:30,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:19:30,171 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:19:30,171 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [61], [67], [72], [76], [78], [84], [94], [98], [203], [236], [245], [279], [286], [349] [2018-12-03 16:19:30,172 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:19:30,172 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:19:30,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:19:30,181 INFO L272 AbstractInterpreter]: Visited 18 different actions 30 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:19:30,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:30,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:19:30,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:30,191 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:19:30,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:30,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:19:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:30,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:19:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:19:30,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:19:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:19:30,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:19:30,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 16:19:30,348 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:19:30,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:19:30,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:19:30,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:19:30,349 INFO L87 Difference]: Start difference. First operand 3318 states and 7706 transitions. Second operand 11 states. [2018-12-03 16:19:40,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:40,675 INFO L93 Difference]: Finished difference Result 4067 states and 9262 transitions. [2018-12-03 16:19:40,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:19:40,676 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:19:40,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:40,681 INFO L225 Difference]: With dead ends: 4067 [2018-12-03 16:19:40,681 INFO L226 Difference]: Without dead ends: 4059 [2018-12-03 16:19:40,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=913, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:19:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4059 states. [2018-12-03 16:19:46,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4059 to 3390. [2018-12-03 16:19:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3390 states. [2018-12-03 16:19:46,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 7874 transitions. [2018-12-03 16:19:46,345 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 7874 transitions. Word has length 20 [2018-12-03 16:19:46,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:46,345 INFO L480 AbstractCegarLoop]: Abstraction has 3390 states and 7874 transitions. [2018-12-03 16:19:46,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:19:46,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 7874 transitions. [2018-12-03 16:19:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:19:46,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:46,346 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:19:46,347 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:46,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash -248100343, now seen corresponding path program 1 times [2018-12-03 16:19:46,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:46,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:46,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:46,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:46,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:19:46,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:46,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:19:46,435 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:19:46,436 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [61], [67], [72], [76], [78], [84], [94], [102], [183], [203], [229], [279], [286], [349] [2018-12-03 16:19:46,437 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:19:46,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:19:46,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:19:46,446 INFO L272 AbstractInterpreter]: Visited 18 different actions 29 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:19:46,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:46,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:19:46,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:46,483 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:19:46,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:46,500 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:19:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:46,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:19:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:19:46,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:19:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:19:46,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:19:46,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 16:19:46,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:19:46,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:19:46,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:19:46,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:19:46,681 INFO L87 Difference]: Start difference. First operand 3390 states and 7874 transitions. Second operand 11 states. [2018-12-03 16:19:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:56,516 INFO L93 Difference]: Finished difference Result 3913 states and 8914 transitions. [2018-12-03 16:19:56,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:19:56,516 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:19:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:56,521 INFO L225 Difference]: With dead ends: 3913 [2018-12-03 16:19:56,521 INFO L226 Difference]: Without dead ends: 3905 [2018-12-03 16:19:56,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:19:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2018-12-03 16:20:02,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3398. [2018-12-03 16:20:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3398 states. [2018-12-03 16:20:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 7878 transitions. [2018-12-03 16:20:02,048 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 7878 transitions. Word has length 20 [2018-12-03 16:20:02,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:20:02,048 INFO L480 AbstractCegarLoop]: Abstraction has 3398 states and 7878 transitions. [2018-12-03 16:20:02,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:20:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 7878 transitions. [2018-12-03 16:20:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:20:02,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:20:02,050 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:20:02,050 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:20:02,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:02,050 INFO L82 PathProgramCache]: Analyzing trace with hash 879416653, now seen corresponding path program 1 times [2018-12-03 16:20:02,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:20:02,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:02,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:02,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:02,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:20:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:02,360 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:20:02,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:02,360 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:20:02,360 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:20:02,360 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [55], [59], [61], [67], [72], [78], [98], [203], [236], [245], [279], [286], [292], [349] [2018-12-03 16:20:02,361 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:20:02,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:20:02,370 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:20:02,370 INFO L272 AbstractInterpreter]: Visited 17 different actions 28 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:20:02,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:02,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:20:02,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:02,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:20:02,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:02,394 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:20:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:02,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:20:02,424 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:20:02,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:20:02,536 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:20:02,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:20:02,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 16:20:02,556 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:20:02,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:20:02,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:20:02,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:20:02,556 INFO L87 Difference]: Start difference. First operand 3398 states and 7878 transitions. Second operand 11 states. [2018-12-03 16:20:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:20:12,685 INFO L93 Difference]: Finished difference Result 3927 states and 8941 transitions. [2018-12-03 16:20:12,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:20:12,686 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:20:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:20:12,691 INFO L225 Difference]: With dead ends: 3927 [2018-12-03 16:20:12,691 INFO L226 Difference]: Without dead ends: 3919 [2018-12-03 16:20:12,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:20:12,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2018-12-03 16:20:18,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3287. [2018-12-03 16:20:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3287 states. [2018-12-03 16:20:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 7609 transitions. [2018-12-03 16:20:18,084 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 7609 transitions. Word has length 20 [2018-12-03 16:20:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:20:18,085 INFO L480 AbstractCegarLoop]: Abstraction has 3287 states and 7609 transitions. [2018-12-03 16:20:18,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:20:18,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 7609 transitions. [2018-12-03 16:20:18,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:20:18,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:20:18,086 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:20:18,086 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:20:18,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:18,086 INFO L82 PathProgramCache]: Analyzing trace with hash 879518798, now seen corresponding path program 1 times [2018-12-03 16:20:18,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:20:18,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:18,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:18,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:18,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:20:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:18,180 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:20:18,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:18,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:20:18,180 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:20:18,180 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [55], [59], [61], [67], [72], [78], [102], [183], [203], [229], [279], [286], [292], [349] [2018-12-03 16:20:18,181 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:20:18,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:20:18,189 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:20:18,189 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:20:18,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:18,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:20:18,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:18,229 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:20:18,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:18,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:20:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:18,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:20:18,441 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:20:18,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:20:18,514 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:20:18,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:20:18,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 16:20:18,533 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:20:18,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:20:18,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:20:18,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:20:18,534 INFO L87 Difference]: Start difference. First operand 3287 states and 7609 transitions. Second operand 11 states. [2018-12-03 16:20:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:20:28,596 INFO L93 Difference]: Finished difference Result 3927 states and 8925 transitions. [2018-12-03 16:20:28,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:20:28,597 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:20:28,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:20:28,601 INFO L225 Difference]: With dead ends: 3927 [2018-12-03 16:20:28,602 INFO L226 Difference]: Without dead ends: 3919 [2018-12-03 16:20:28,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:20:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2018-12-03 16:20:34,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3255. [2018-12-03 16:20:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2018-12-03 16:20:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 7545 transitions. [2018-12-03 16:20:34,422 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 7545 transitions. Word has length 20 [2018-12-03 16:20:34,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:20:34,422 INFO L480 AbstractCegarLoop]: Abstraction has 3255 states and 7545 transitions. [2018-12-03 16:20:34,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:20:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 7545 transitions. [2018-12-03 16:20:34,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:20:34,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:20:34,425 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:20:34,425 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:20:34,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:34,425 INFO L82 PathProgramCache]: Analyzing trace with hash 987368945, now seen corresponding path program 1 times [2018-12-03 16:20:34,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:20:34,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:34,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:34,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:34,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:20:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:20:34,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:34,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:20:34,522 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:20:34,522 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [61], [67], [72], [78], [174], [183], [203], [279], [283], [286], [349] [2018-12-03 16:20:34,523 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:20:34,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:20:34,530 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:20:34,531 INFO L272 AbstractInterpreter]: Visited 15 different actions 21 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:20:34,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:34,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:20:34,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:34,540 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:20:34,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:34,548 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:20:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:34,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:20:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:20:34,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:20:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:20:34,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:20:34,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 16:20:34,679 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:20:34,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:20:34,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:20:34,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:20:34,680 INFO L87 Difference]: Start difference. First operand 3255 states and 7545 transitions. Second operand 11 states. [2018-12-03 16:20:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:20:44,550 INFO L93 Difference]: Finished difference Result 3749 states and 8537 transitions. [2018-12-03 16:20:44,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:20:44,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:20:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:20:44,555 INFO L225 Difference]: With dead ends: 3749 [2018-12-03 16:20:44,555 INFO L226 Difference]: Without dead ends: 3741 [2018-12-03 16:20:44,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:20:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2018-12-03 16:20:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3159. [2018-12-03 16:20:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3159 states. [2018-12-03 16:20:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 7307 transitions. [2018-12-03 16:20:49,956 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 7307 transitions. Word has length 20 [2018-12-03 16:20:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:20:49,956 INFO L480 AbstractCegarLoop]: Abstraction has 3159 states and 7307 transitions. [2018-12-03 16:20:49,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:20:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 7307 transitions. [2018-12-03 16:20:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:20:49,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:20:49,958 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:20:49,958 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:20:49,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:49,958 INFO L82 PathProgramCache]: Analyzing trace with hash -461254251, now seen corresponding path program 1 times [2018-12-03 16:20:49,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:20:49,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:49,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:49,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:49,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:20:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:50,055 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:20:50,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:50,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:20:50,055 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 16:20:50,055 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [76], [84], [92], [251], [317], [323], [331], [333], [337], [339], [345], [351] [2018-12-03 16:20:50,056 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:20:50,056 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:20:50,072 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:20:50,072 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:20:50,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:50,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:20:50,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:50,108 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:20:50,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:50,125 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:20:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:50,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:20:50,209 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:20:50,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:20:50,337 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:20:50,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:20:50,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2018-12-03 16:20:50,356 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:20:50,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:20:50,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:20:50,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:20:50,357 INFO L87 Difference]: Start difference. First operand 3159 states and 7307 transitions. Second operand 16 states. [2018-12-03 16:21:13,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:21:13,507 INFO L93 Difference]: Finished difference Result 7375 states and 16617 transitions. [2018-12-03 16:21:13,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:21:13,507 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-12-03 16:21:13,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:21:13,514 INFO L225 Difference]: With dead ends: 7375 [2018-12-03 16:21:13,514 INFO L226 Difference]: Without dead ends: 7367 [2018-12-03 16:21:13,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1649 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1282, Invalid=5524, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 16:21:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7367 states. [2018-12-03 16:21:21,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7367 to 4599. [2018-12-03 16:21:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4599 states. [2018-12-03 16:21:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 10707 transitions. [2018-12-03 16:21:21,946 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 10707 transitions. Word has length 21 [2018-12-03 16:21:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:21:21,946 INFO L480 AbstractCegarLoop]: Abstraction has 4599 states and 10707 transitions. [2018-12-03 16:21:21,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:21:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 10707 transitions. [2018-12-03 16:21:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:21:21,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:21:21,949 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:21,949 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:21:21,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:21:21,949 INFO L82 PathProgramCache]: Analyzing trace with hash 504785992, now seen corresponding path program 1 times [2018-12-03 16:21:21,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:21:21,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:21,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:21:21,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:21,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:21:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:21:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:21:22,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:21:22,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:21:22,041 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:21:22,042 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:21:22,043 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:21:22,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:21:22,051 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:21:22,051 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:21:22,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:21:22,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:21:22,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:21:22,084 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:21:22,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:21:22,094 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:21:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:21:22,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:21:22,230 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:21:22,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:21:22,373 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:21:22,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:21:22,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2018-12-03 16:21:22,393 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:21:22,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:21:22,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:21:22,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:21:22,393 INFO L87 Difference]: Start difference. First operand 4599 states and 10707 transitions. Second operand 18 states. [2018-12-03 16:21:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:21:55,988 INFO L93 Difference]: Finished difference Result 14286 states and 33130 transitions. [2018-12-03 16:21:55,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 16:21:55,989 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-12-03 16:21:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:21:56,001 INFO L225 Difference]: With dead ends: 14286 [2018-12-03 16:21:56,001 INFO L226 Difference]: Without dead ends: 9688 [2018-12-03 16:21:56,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4492 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1570, Invalid=12472, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 16:21:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9688 states. [2018-12-03 16:22:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9688 to 5855. [2018-12-03 16:22:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5855 states. [2018-12-03 16:22:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5855 states to 5855 states and 13668 transitions. [2018-12-03 16:22:07,666 INFO L78 Accepts]: Start accepts. Automaton has 5855 states and 13668 transitions. Word has length 24 [2018-12-03 16:22:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:22:07,666 INFO L480 AbstractCegarLoop]: Abstraction has 5855 states and 13668 transitions. [2018-12-03 16:22:07,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:22:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 5855 states and 13668 transitions. [2018-12-03 16:22:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:22:07,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:22:07,668 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:07,669 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:22:07,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:07,669 INFO L82 PathProgramCache]: Analyzing trace with hash 509499548, now seen corresponding path program 1 times [2018-12-03 16:22:07,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:22:07,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:07,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:22:07,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:07,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:22:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:22:07,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:07,783 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:22:07,783 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:22:07,783 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [92], [102], [104], [110], [113], [115], [120], [128], [132], [186], [192], [203], [229], [236], [245], [254], [260], [274], [292], [349] [2018-12-03 16:22:07,784 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:22:07,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:22:07,801 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:22:07,801 INFO L272 AbstractInterpreter]: Visited 24 different actions 42 times. Merged at 13 different actions 15 times. Never widened. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 16:22:07,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:07,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:22:07,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:07,828 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:22:07,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:22:07,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:22:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:07,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:22:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:22:08,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:22:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:22:08,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:22:08,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2018-12-03 16:22:08,164 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:22:08,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:22:08,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:22:08,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:22:08,165 INFO L87 Difference]: Start difference. First operand 5855 states and 13668 transitions. Second operand 19 states. [2018-12-03 16:22:44,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:22:44,881 INFO L93 Difference]: Finished difference Result 16129 states and 37112 transitions. [2018-12-03 16:22:44,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 16:22:44,882 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 16:22:44,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:22:44,894 INFO L225 Difference]: With dead ends: 16129 [2018-12-03 16:22:44,894 INFO L226 Difference]: Without dead ends: 10275 [2018-12-03 16:22:44,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3187 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1141, Invalid=9989, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:22:44,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10275 states. [2018-12-03 16:22:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10275 to 5769. [2018-12-03 16:22:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-12-03 16:22:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 13438 transitions. [2018-12-03 16:22:56,859 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 13438 transitions. Word has length 24 [2018-12-03 16:22:56,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:22:56,859 INFO L480 AbstractCegarLoop]: Abstraction has 5769 states and 13438 transitions. [2018-12-03 16:22:56,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:22:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 13438 transitions. [2018-12-03 16:22:56,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:22:56,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:22:56,862 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:56,863 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:22:56,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:56,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1404455971, now seen corresponding path program 1 times [2018-12-03 16:22:56,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:22:56,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:56,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:22:56,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:56,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:22:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:22:56,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:56,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:22:56,964 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:22:56,964 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [94], [98], [104], [110], [113], [115], [120], [128], [132], [179], [203], [217], [236], [245], [260], [274], [292], [298], [310], [349] [2018-12-03 16:22:56,965 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:22:56,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:22:56,976 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:22:56,977 INFO L272 AbstractInterpreter]: Visited 24 different actions 45 times. Merged at 12 different actions 16 times. Never widened. Found 8 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 16:22:56,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:56,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:22:56,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:56,987 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:22:56,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:22:56,996 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:22:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:57,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:22:57,220 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:22:57,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:22:57,369 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:22:57,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:22:57,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2018-12-03 16:22:57,388 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:22:57,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:22:57,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:22:57,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:22:57,389 INFO L87 Difference]: Start difference. First operand 5769 states and 13438 transitions. Second operand 19 states. [2018-12-03 16:23:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:23:30,899 INFO L93 Difference]: Finished difference Result 14938 states and 34438 transitions. [2018-12-03 16:23:30,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:23:30,900 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 16:23:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:23:30,911 INFO L225 Difference]: With dead ends: 14938 [2018-12-03 16:23:30,911 INFO L226 Difference]: Without dead ends: 9170 [2018-12-03 16:23:30,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2440 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1084, Invalid=8228, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 16:23:30,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9170 states. [2018-12-03 16:23:43,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9170 to 5949. [2018-12-03 16:23:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5949 states. [2018-12-03 16:23:43,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5949 states to 5949 states and 13878 transitions. [2018-12-03 16:23:43,726 INFO L78 Accepts]: Start accepts. Automaton has 5949 states and 13878 transitions. Word has length 24 [2018-12-03 16:23:43,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:23:43,726 INFO L480 AbstractCegarLoop]: Abstraction has 5949 states and 13878 transitions. [2018-12-03 16:23:43,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:23:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 5949 states and 13878 transitions. [2018-12-03 16:23:43,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:23:43,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:23:43,729 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:23:43,730 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:23:43,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:23:43,730 INFO L82 PathProgramCache]: Analyzing trace with hash -263596200, now seen corresponding path program 1 times [2018-12-03 16:23:43,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:23:43,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:43,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:23:43,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:43,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:23:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:44,598 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:23:44,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:44,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:23:44,599 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:23:44,599 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [94], [102], [113], [115], [120], [128], [132], [179], [183], [203], [217], [229], [260], [274], [298], [300], [310], [349] [2018-12-03 16:23:44,600 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:23:44,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:23:44,611 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:23:44,611 INFO L272 AbstractInterpreter]: Visited 22 different actions 44 times. Merged at 13 different actions 19 times. Never widened. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 16:23:44,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:23:44,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:23:44,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:44,615 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:23:44,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:23:44,623 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:23:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:44,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:23:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:23:44,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:23:44,986 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:45,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:23:45,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2018-12-03 16:23:45,005 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:23:45,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:23:45,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:23:45,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:23:45,006 INFO L87 Difference]: Start difference. First operand 5949 states and 13878 transitions. Second operand 20 states. [2018-12-03 16:24:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:14,487 INFO L93 Difference]: Finished difference Result 14210 states and 32884 transitions. [2018-12-03 16:24:14,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:24:14,488 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-12-03 16:24:14,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:14,498 INFO L225 Difference]: With dead ends: 14210 [2018-12-03 16:24:14,498 INFO L226 Difference]: Without dead ends: 8262 [2018-12-03 16:24:14,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=804, Invalid=5358, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 16:24:14,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8262 states. [2018-12-03 16:24:26,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8262 to 5994. [2018-12-03 16:24:26,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5994 states. [2018-12-03 16:24:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 13948 transitions. [2018-12-03 16:24:26,929 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 13948 transitions. Word has length 24 [2018-12-03 16:24:26,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:26,929 INFO L480 AbstractCegarLoop]: Abstraction has 5994 states and 13948 transitions. [2018-12-03 16:24:26,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:24:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 13948 transitions. [2018-12-03 16:24:26,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:24:26,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:26,932 INFO L402 BasicCegarLoop]: trace histogram [2, 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:24:26,932 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:26,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:26,933 INFO L82 PathProgramCache]: Analyzing trace with hash 792000147, now seen corresponding path program 1 times [2018-12-03 16:24:26,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:26,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:26,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:26,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:26,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:27,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:27,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:27,082 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 16:24:27,082 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [92], [113], [120], [128], [134], [142], [144], [148], [155], [162], [168], [203], [236], [245], [254], [260], [264], [274], [349] [2018-12-03 16:24:27,083 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:24:27,083 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:24:27,095 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:24:27,095 INFO L272 AbstractInterpreter]: Visited 23 different actions 45 times. Merged at 14 different actions 19 times. Never widened. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 16:24:27,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:27,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:24:27,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:27,108 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:27,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:27,116 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:27,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:27,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:27,937 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:24:27,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:27,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2018-12-03 16:24:27,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:27,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:24:27,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:24:27,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:24:27,957 INFO L87 Difference]: Start difference. First operand 5994 states and 13948 transitions. Second operand 19 states. [2018-12-03 16:25:04,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:04,531 INFO L93 Difference]: Finished difference Result 17571 states and 41216 transitions. [2018-12-03 16:25:04,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:25:04,531 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 16:25:04,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:04,545 INFO L225 Difference]: With dead ends: 17571 [2018-12-03 16:25:04,546 INFO L226 Difference]: Without dead ends: 11578 [2018-12-03 16:25:04,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1743 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=810, Invalid=6162, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:25:04,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11578 states.