java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:08:21,359 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:08:21,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:08:21,377 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:08:21,378 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:08:21,379 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:08:21,380 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:08:21,382 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:08:21,383 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:08:21,384 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:08:21,385 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:08:21,386 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:08:21,387 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:08:21,388 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:08:21,389 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:08:21,390 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:08:21,390 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:08:21,392 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:08:21,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:08:21,396 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:08:21,397 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:08:21,398 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:08:21,401 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:08:21,401 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:08:21,402 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:08:21,403 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:08:21,404 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:08:21,405 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:08:21,405 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:08:21,407 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:08:21,407 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:08:21,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:08:21,408 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:08:21,408 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:08:21,409 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:08:21,410 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:08:21,410 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:08:21,432 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:08:21,432 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:08:21,433 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:08:21,433 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:08:21,433 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:08:21,434 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:08:21,434 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:08:21,434 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:08:21,434 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:08:21,434 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:08:21,435 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:08:21,435 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:08:21,435 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:08:21,435 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:08:21,435 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:08:21,436 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:08:21,436 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:08:21,436 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:08:21,437 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:08:21,437 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:08:21,437 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:08:21,437 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:08:21,437 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:08:21,438 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:08:21,438 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:08:21,438 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:08:21,438 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:08:21,438 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:08:21,439 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:08:21,439 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:08:21,439 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:08:21,439 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:08:21,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:08:21,440 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:08:21,440 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:08:21,440 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:08:21,440 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:08:21,440 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:08:21,440 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:08:21,441 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:08:21,441 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:08:21,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:08:21,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:08:21,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:08:21,498 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:08:21,499 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:08:21,499 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-12-03 15:08:21,500 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-12-03 15:08:21,535 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:08:21,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:08:21,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:08:21,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:08:21,537 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:08:21,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:21" (1/1) ... [2018-12-03 15:08:21,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:21" (1/1) ... [2018-12-03 15:08:21,569 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:08:21,569 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:08:21,570 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:08:21,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:08:21,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:08:21,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:08:21,573 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:08:21,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:21" (1/1) ... [2018-12-03 15:08:21,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:21" (1/1) ... [2018-12-03 15:08:21,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:21" (1/1) ... [2018-12-03 15:08:21,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:21" (1/1) ... [2018-12-03 15:08:21,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:21" (1/1) ... [2018-12-03 15:08:21,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:21" (1/1) ... [2018-12-03 15:08:21,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:21" (1/1) ... [2018-12-03 15:08:21,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:08:21,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:08:21,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:08:21,596 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:08:21,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:08:21,662 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 15:08:21,662 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 15:08:21,662 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 15:08:22,056 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:08:22,057 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:08:22,057 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:08:22 BoogieIcfgContainer [2018-12-03 15:08:22,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:08:22,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:08:22,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:08:22,062 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:08:22,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:21" (1/2) ... [2018-12-03 15:08:22,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e3df4f and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:08:22, skipping insertion in model container [2018-12-03 15:08:22,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:08:22" (2/2) ... [2018-12-03 15:08:22,065 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-12-03 15:08:22,076 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:08:22,083 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-03 15:08:22,099 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-03 15:08:22,135 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:08:22,135 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:08:22,136 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:08:22,136 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:08:22,136 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:08:22,136 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:08:22,136 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:08:22,136 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:08:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 15:08:22,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:08:22,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:22,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:08:22,162 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:22,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:22,169 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-12-03 15:08:22,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:22,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:22,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:22,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:22,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:22,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:22,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:08:22,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:22,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:08:22,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:08:22,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:08:22,402 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-12-03 15:08:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:22,926 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-12-03 15:08:22,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:08:22,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 15:08:22,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:22,942 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:08:22,943 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:08:22,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:08:22,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:08:22,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-03 15:08:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:08:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-12-03 15:08:22,989 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-12-03 15:08:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:22,989 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-12-03 15:08:22,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:08:22,990 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-12-03 15:08:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:08:22,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:22,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:08:22,991 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:22,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:22,992 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-12-03 15:08:22,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:22,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:22,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:22,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:22,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:23,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:23,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:08:23,066 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:23,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:08:23,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:08:23,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:08:23,069 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-12-03 15:08:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:23,433 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-12-03 15:08:23,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:08:23,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 15:08:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:23,435 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:08:23,435 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:08:23,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:08:23,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:08:23,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-12-03 15:08:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:08:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-12-03 15:08:23,445 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-12-03 15:08:23,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:23,446 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-12-03 15:08:23,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:08:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-12-03 15:08:23,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:08:23,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:23,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:08:23,447 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:23,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:23,448 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-12-03 15:08:23,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:23,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:23,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:23,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:23,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:23,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:23,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:08:23,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:23,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:08:23,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:08:23,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:08:23,546 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-12-03 15:08:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:24,192 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-12-03 15:08:24,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:08:24,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 15:08:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:24,195 INFO L225 Difference]: With dead ends: 43 [2018-12-03 15:08:24,195 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 15:08:24,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:08:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 15:08:24,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-12-03 15:08:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 15:08:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-12-03 15:08:24,206 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-12-03 15:08:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:24,207 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-12-03 15:08:24,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:08:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-12-03 15:08:24,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:08:24,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:24,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:08:24,208 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:24,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:24,209 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-12-03 15:08:24,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:24,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:24,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:24,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:24,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:24,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:24,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:08:24,269 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:24,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:08:24,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:08:24,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:08:24,270 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-12-03 15:08:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:24,538 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-12-03 15:08:24,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:08:24,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 15:08:24,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:24,540 INFO L225 Difference]: With dead ends: 54 [2018-12-03 15:08:24,540 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:08:24,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:08:24,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:08:24,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-12-03 15:08:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 15:08:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-12-03 15:08:24,555 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-12-03 15:08:24,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:24,556 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-12-03 15:08:24,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:08:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-12-03 15:08:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:08:24,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:24,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:24,557 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:24,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:24,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-12-03 15:08:24,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:24,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:24,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:24,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:24,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:24,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:24,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:24,778 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 15:08:24,780 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [38], [41], [45], [46] [2018-12-03 15:08:24,821 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:24,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:24,961 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:24,963 INFO L272 AbstractInterpreter]: Visited 8 different actions 11 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:08:25,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:25,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:25,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:25,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:25,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:25,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:25,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:25,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:25,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:25,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2018-12-03 15:08:25,644 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:25,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:08:25,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:08:25,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:08:25,647 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 14 states. [2018-12-03 15:08:26,943 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-12-03 15:08:27,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:27,322 INFO L93 Difference]: Finished difference Result 107 states and 168 transitions. [2018-12-03 15:08:27,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:08:27,322 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-12-03 15:08:27,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:27,328 INFO L225 Difference]: With dead ends: 107 [2018-12-03 15:08:27,328 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 15:08:27,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:08:27,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 15:08:27,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-12-03 15:08:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:08:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2018-12-03 15:08:27,346 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 8 [2018-12-03 15:08:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:27,346 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 109 transitions. [2018-12-03 15:08:27,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:08:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2018-12-03 15:08:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:08:27,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:27,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:27,349 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:27,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:27,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-12-03 15:08:27,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:27,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:27,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:27,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:27,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:27,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:27,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 15:08:27,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:27,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:27,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:27,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:27,472 INFO L87 Difference]: Start difference. First operand 64 states and 109 transitions. Second operand 8 states. [2018-12-03 15:08:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:27,806 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2018-12-03 15:08:27,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:08:27,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:08:27,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:27,809 INFO L225 Difference]: With dead ends: 95 [2018-12-03 15:08:27,809 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 15:08:27,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:08:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 15:08:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-12-03 15:08:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 15:08:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 134 transitions. [2018-12-03 15:08:27,828 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 134 transitions. Word has length 8 [2018-12-03 15:08:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:27,828 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 134 transitions. [2018-12-03 15:08:27,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 134 transitions. [2018-12-03 15:08:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:08:27,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:27,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:27,830 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:27,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:27,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-12-03 15:08:27,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:27,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:27,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:27,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:27,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:27,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:27,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:27,922 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 15:08:27,922 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [37], [45], [47], [50] [2018-12-03 15:08:27,924 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:27,924 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:27,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:27,943 INFO L272 AbstractInterpreter]: Visited 8 different actions 11 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:08:28,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:28,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:28,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:28,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:28,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:28,040 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:28,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:28,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:28,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:28,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2018-12-03 15:08:28,359 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:28,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:08:28,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:08:28,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:08:28,360 INFO L87 Difference]: Start difference. First operand 77 states and 134 transitions. Second operand 13 states. [2018-12-03 15:08:29,143 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-12-03 15:08:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:30,098 INFO L93 Difference]: Finished difference Result 150 states and 246 transitions. [2018-12-03 15:08:30,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:08:30,098 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-12-03 15:08:30,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:30,100 INFO L225 Difference]: With dead ends: 150 [2018-12-03 15:08:30,101 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 15:08:30,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=422, Invalid=1300, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:08:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 15:08:30,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2018-12-03 15:08:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 15:08:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 185 transitions. [2018-12-03 15:08:30,125 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 185 transitions. Word has length 8 [2018-12-03 15:08:30,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:30,125 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 185 transitions. [2018-12-03 15:08:30,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:08:30,125 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 185 transitions. [2018-12-03 15:08:30,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:08:30,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:30,126 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:30,127 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:30,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:30,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-12-03 15:08:30,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:30,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:30,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:30,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:30,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:30,200 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 15:08:30,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:30,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:30,201 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 15:08:30,201 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [45], [46], [47], [50] [2018-12-03 15:08:30,202 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:30,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:30,212 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:30,213 INFO L272 AbstractInterpreter]: Visited 7 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:08:30,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:30,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:30,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:30,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:30,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:30,226 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:30,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:30,481 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 15:08:30,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:30,584 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 15:08:30,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:30,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2018-12-03 15:08:30,603 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:30,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:08:30,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:08:30,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:08:30,605 INFO L87 Difference]: Start difference. First operand 106 states and 185 transitions. Second operand 13 states. [2018-12-03 15:08:31,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:31,816 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2018-12-03 15:08:31,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:08:31,817 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-12-03 15:08:31,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:31,818 INFO L225 Difference]: With dead ends: 137 [2018-12-03 15:08:31,818 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 15:08:31,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:08:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 15:08:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2018-12-03 15:08:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 15:08:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 194 transitions. [2018-12-03 15:08:31,856 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 194 transitions. Word has length 8 [2018-12-03 15:08:31,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:31,857 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 194 transitions. [2018-12-03 15:08:31,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:08:31,857 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 194 transitions. [2018-12-03 15:08:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:08:31,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:31,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:31,858 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:31,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:31,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-12-03 15:08:31,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:31,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:31,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:31,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:31,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:31,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:31,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:31,993 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 15:08:31,993 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [17], [25], [26] [2018-12-03 15:08:31,994 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:31,994 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:32,013 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:32,013 INFO L272 AbstractInterpreter]: Visited 8 different actions 13 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:08:32,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:32,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:32,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:32,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:32,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:32,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:32,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:32,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:32,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:32,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-12-03 15:08:32,257 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:32,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:08:32,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:08:32,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:08:32,258 INFO L87 Difference]: Start difference. First operand 111 states and 194 transitions. Second operand 12 states. [2018-12-03 15:08:33,014 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-03 15:08:33,666 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 15:08:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:33,880 INFO L93 Difference]: Finished difference Result 211 states and 359 transitions. [2018-12-03 15:08:33,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:08:33,883 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2018-12-03 15:08:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:33,884 INFO L225 Difference]: With dead ends: 211 [2018-12-03 15:08:33,885 INFO L226 Difference]: Without dead ends: 209 [2018-12-03 15:08:33,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=292, Invalid=764, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:08:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-03 15:08:33,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 173. [2018-12-03 15:08:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-03 15:08:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 304 transitions. [2018-12-03 15:08:33,921 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 304 transitions. Word has length 8 [2018-12-03 15:08:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:33,922 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 304 transitions. [2018-12-03 15:08:33,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:08:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2018-12-03 15:08:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:08:33,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:33,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:33,924 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:33,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:33,924 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-12-03 15:08:33,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:33,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:33,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:33,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:33,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:34,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:34,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:34,013 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 15:08:34,014 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [38], [41], [45], [46] [2018-12-03 15:08:34,015 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:34,015 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:34,028 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:34,029 INFO L272 AbstractInterpreter]: Visited 8 different actions 11 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:08:34,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:34,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:34,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:34,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:34,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:34,049 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:34,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:34,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:34,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:34,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-03 15:08:34,239 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:34,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:08:34,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:08:34,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:08:34,240 INFO L87 Difference]: Start difference. First operand 173 states and 304 transitions. Second operand 10 states. [2018-12-03 15:08:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:34,974 INFO L93 Difference]: Finished difference Result 246 states and 415 transitions. [2018-12-03 15:08:34,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:08:34,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-12-03 15:08:34,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:34,977 INFO L225 Difference]: With dead ends: 246 [2018-12-03 15:08:34,977 INFO L226 Difference]: Without dead ends: 245 [2018-12-03 15:08:34,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:08:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-03 15:08:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 201. [2018-12-03 15:08:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-03 15:08:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 358 transitions. [2018-12-03 15:08:35,019 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 358 transitions. Word has length 8 [2018-12-03 15:08:35,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:35,019 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 358 transitions. [2018-12-03 15:08:35,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:08:35,020 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 358 transitions. [2018-12-03 15:08:35,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:08:35,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:35,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:35,021 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:35,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:35,022 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-12-03 15:08:35,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:35,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:35,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:35,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:35,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:35,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:35,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:35,175 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 15:08:35,175 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [26], [36], [38], [43] [2018-12-03 15:08:35,176 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:35,177 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:35,191 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:35,191 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:08:35,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:35,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:35,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:35,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:35,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:35,229 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:35,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:35,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:35,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:35,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 15:08:35,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:35,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:08:35,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:08:35,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:08:35,304 INFO L87 Difference]: Start difference. First operand 201 states and 358 transitions. Second operand 7 states. [2018-12-03 15:08:35,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:35,625 INFO L93 Difference]: Finished difference Result 252 states and 436 transitions. [2018-12-03 15:08:35,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:08:35,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 15:08:35,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:35,628 INFO L225 Difference]: With dead ends: 252 [2018-12-03 15:08:35,628 INFO L226 Difference]: Without dead ends: 250 [2018-12-03 15:08:35,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:08:35,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-03 15:08:35,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 210. [2018-12-03 15:08:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-03 15:08:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 375 transitions. [2018-12-03 15:08:35,663 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 375 transitions. Word has length 8 [2018-12-03 15:08:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:35,663 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 375 transitions. [2018-12-03 15:08:35,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:08:35,664 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 375 transitions. [2018-12-03 15:08:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:08:35,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:35,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:35,665 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:35,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:35,665 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-12-03 15:08:35,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:35,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:35,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:35,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:35,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:35,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:35,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:35,782 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 15:08:35,782 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [37], [45], [47], [50] [2018-12-03 15:08:35,785 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:35,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:35,805 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:35,805 INFO L272 AbstractInterpreter]: Visited 8 different actions 11 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:08:35,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:35,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:35,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:35,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:35,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:35,827 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:35,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:35,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:36,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:36,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-03 15:08:36,108 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:36,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:08:36,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:08:36,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:08:36,109 INFO L87 Difference]: Start difference. First operand 210 states and 375 transitions. Second operand 10 states. [2018-12-03 15:08:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:36,631 INFO L93 Difference]: Finished difference Result 260 states and 452 transitions. [2018-12-03 15:08:36,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:08:36,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-12-03 15:08:36,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:36,636 INFO L225 Difference]: With dead ends: 260 [2018-12-03 15:08:36,637 INFO L226 Difference]: Without dead ends: 259 [2018-12-03 15:08:36,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:08:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-12-03 15:08:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 229. [2018-12-03 15:08:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-03 15:08:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 409 transitions. [2018-12-03 15:08:36,674 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 409 transitions. Word has length 8 [2018-12-03 15:08:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:36,675 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 409 transitions. [2018-12-03 15:08:36,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:08:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 409 transitions. [2018-12-03 15:08:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:08:36,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:36,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:36,676 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:36,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:36,677 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-12-03 15:08:36,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:36,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:36,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:36,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:36,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:36,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:36,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 15:08:36,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:36,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:08:36,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:08:36,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:08:36,764 INFO L87 Difference]: Start difference. First operand 229 states and 409 transitions. Second operand 7 states. [2018-12-03 15:08:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:37,206 INFO L93 Difference]: Finished difference Result 316 states and 557 transitions. [2018-12-03 15:08:37,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:08:37,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 15:08:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:37,208 INFO L225 Difference]: With dead ends: 316 [2018-12-03 15:08:37,208 INFO L226 Difference]: Without dead ends: 314 [2018-12-03 15:08:37,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:08:37,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-03 15:08:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-12-03 15:08:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-03 15:08:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 438 transitions. [2018-12-03 15:08:37,249 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 438 transitions. Word has length 8 [2018-12-03 15:08:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:37,250 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 438 transitions. [2018-12-03 15:08:37,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:08:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 438 transitions. [2018-12-03 15:08:37,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:08:37,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:37,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:37,251 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:37,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:37,251 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-12-03 15:08:37,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:37,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:37,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:37,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:37,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:37,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:37,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:37,355 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 15:08:37,355 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [25], [27], [32] [2018-12-03 15:08:37,356 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:37,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:37,369 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:37,370 INFO L272 AbstractInterpreter]: Visited 8 different actions 13 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:08:37,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:37,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:37,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:37,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:37,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:37,398 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:37,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:37,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:37,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:37,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 15:08:37,473 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:37,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:08:37,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:08:37,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:08:37,474 INFO L87 Difference]: Start difference. First operand 245 states and 438 transitions. Second operand 7 states. [2018-12-03 15:08:37,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:37,991 INFO L93 Difference]: Finished difference Result 428 states and 767 transitions. [2018-12-03 15:08:37,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:08:37,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 15:08:37,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:37,993 INFO L225 Difference]: With dead ends: 428 [2018-12-03 15:08:37,994 INFO L226 Difference]: Without dead ends: 426 [2018-12-03 15:08:37,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:08:37,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-12-03 15:08:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 345. [2018-12-03 15:08:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-12-03 15:08:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 622 transitions. [2018-12-03 15:08:38,058 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 622 transitions. Word has length 8 [2018-12-03 15:08:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:38,058 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 622 transitions. [2018-12-03 15:08:38,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:08:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 622 transitions. [2018-12-03 15:08:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:08:38,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:38,059 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:38,060 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:38,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:38,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-12-03 15:08:38,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:38,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:38,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:38,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:38,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:38,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:38,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:38,269 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 15:08:38,270 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [37], [38], [41], [45], [47], [50] [2018-12-03 15:08:38,271 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:38,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:38,299 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:38,299 INFO L272 AbstractInterpreter]: Visited 10 different actions 21 times. Merged at 7 different actions 8 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:08:38,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:38,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:38,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:38,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:38,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:38,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:38,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:38,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:38,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:38,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2018-12-03 15:08:38,444 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:38,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:08:38,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:08:38,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:08:38,445 INFO L87 Difference]: Start difference. First operand 345 states and 622 transitions. Second operand 10 states. [2018-12-03 15:08:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:39,481 INFO L93 Difference]: Finished difference Result 466 states and 826 transitions. [2018-12-03 15:08:39,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:08:39,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 15:08:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:39,484 INFO L225 Difference]: With dead ends: 466 [2018-12-03 15:08:39,484 INFO L226 Difference]: Without dead ends: 464 [2018-12-03 15:08:39,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:08:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-12-03 15:08:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 351. [2018-12-03 15:08:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-12-03 15:08:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 634 transitions. [2018-12-03 15:08:39,566 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 634 transitions. Word has length 11 [2018-12-03 15:08:39,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:39,567 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 634 transitions. [2018-12-03 15:08:39,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:08:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 634 transitions. [2018-12-03 15:08:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:08:39,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:39,568 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:39,568 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:39,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:39,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-12-03 15:08:39,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:39,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:39,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:39,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:39,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:40,437 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 15:08:40,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:40,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:40,438 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 15:08:40,438 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [27], [30], [36], [38], [43] [2018-12-03 15:08:40,439 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:40,439 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:40,448 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:40,448 INFO L272 AbstractInterpreter]: Visited 10 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:08:40,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:40,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:40,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:40,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:40,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:40,469 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:40,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:40,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:40,682 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:08:40,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7] total 17 [2018-12-03 15:08:40,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:40,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:08:40,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:08:40,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:08:40,684 INFO L87 Difference]: Start difference. First operand 351 states and 634 transitions. Second operand 7 states. [2018-12-03 15:08:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:41,194 INFO L93 Difference]: Finished difference Result 826 states and 1461 transitions. [2018-12-03 15:08:41,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:08:41,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 15:08:41,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:41,200 INFO L225 Difference]: With dead ends: 826 [2018-12-03 15:08:41,200 INFO L226 Difference]: Without dead ends: 476 [2018-12-03 15:08:41,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:08:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-12-03 15:08:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 377. [2018-12-03 15:08:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-12-03 15:08:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 677 transitions. [2018-12-03 15:08:41,289 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 677 transitions. Word has length 11 [2018-12-03 15:08:41,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:41,290 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 677 transitions. [2018-12-03 15:08:41,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:08:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 677 transitions. [2018-12-03 15:08:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:08:41,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:41,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:41,291 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:41,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:41,291 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-12-03 15:08:41,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:41,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:41,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:41,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:41,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:41,528 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 15:08:41,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:41,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 15:08:41,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:41,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:41,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:41,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:41,529 INFO L87 Difference]: Start difference. First operand 377 states and 677 transitions. Second operand 8 states. [2018-12-03 15:08:42,127 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 15:08:42,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:42,599 INFO L93 Difference]: Finished difference Result 470 states and 828 transitions. [2018-12-03 15:08:42,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:08:42,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-12-03 15:08:42,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:42,602 INFO L225 Difference]: With dead ends: 470 [2018-12-03 15:08:42,602 INFO L226 Difference]: Without dead ends: 468 [2018-12-03 15:08:42,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:08:42,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-12-03 15:08:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 390. [2018-12-03 15:08:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-12-03 15:08:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 695 transitions. [2018-12-03 15:08:42,698 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 695 transitions. Word has length 11 [2018-12-03 15:08:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:42,698 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 695 transitions. [2018-12-03 15:08:42,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 695 transitions. [2018-12-03 15:08:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:08:42,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:42,700 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:42,700 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:42,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:42,700 INFO L82 PathProgramCache]: Analyzing trace with hash 739509354, now seen corresponding path program 1 times [2018-12-03 15:08:42,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:42,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:42,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:42,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:42,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:42,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:42,812 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:42,812 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 15:08:42,813 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [11], [12], [15], [19], [45], [47], [52] [2018-12-03 15:08:42,814 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:42,814 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:42,846 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:42,846 INFO L272 AbstractInterpreter]: Visited 10 different actions 24 times. Merged at 8 different actions 11 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:08:42,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:42,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:42,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:42,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:42,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:42,889 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:42,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:42,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:43,110 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 15:08:43,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 15:08:43,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 8] total 16 [2018-12-03 15:08:43,130 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:43,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:08:43,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:08:43,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:08:43,131 INFO L87 Difference]: Start difference. First operand 390 states and 695 transitions. Second operand 7 states. [2018-12-03 15:08:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:43,326 INFO L93 Difference]: Finished difference Result 878 states and 1557 transitions. [2018-12-03 15:08:43,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:08:43,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 15:08:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:43,329 INFO L225 Difference]: With dead ends: 878 [2018-12-03 15:08:43,329 INFO L226 Difference]: Without dead ends: 489 [2018-12-03 15:08:43,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:08:43,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-12-03 15:08:43,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 451. [2018-12-03 15:08:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-12-03 15:08:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 793 transitions. [2018-12-03 15:08:43,430 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 793 transitions. Word has length 11 [2018-12-03 15:08:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:43,430 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 793 transitions. [2018-12-03 15:08:43,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:08:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 793 transitions. [2018-12-03 15:08:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:08:43,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:43,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:43,431 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:43,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:43,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-12-03 15:08:43,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:43,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:43,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:43,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:43,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:43,820 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 15:08:43,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:43,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:43,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:43,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:43,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:43,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:43,821 INFO L87 Difference]: Start difference. First operand 451 states and 793 transitions. Second operand 8 states. [2018-12-03 15:08:44,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:44,165 INFO L93 Difference]: Finished difference Result 502 states and 862 transitions. [2018-12-03 15:08:44,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:08:44,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-12-03 15:08:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:44,176 INFO L225 Difference]: With dead ends: 502 [2018-12-03 15:08:44,176 INFO L226 Difference]: Without dead ends: 500 [2018-12-03 15:08:44,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:08:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-12-03 15:08:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 449. [2018-12-03 15:08:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-12-03 15:08:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 788 transitions. [2018-12-03 15:08:44,278 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 788 transitions. Word has length 11 [2018-12-03 15:08:44,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:44,278 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 788 transitions. [2018-12-03 15:08:44,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 788 transitions. [2018-12-03 15:08:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:08:44,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:44,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:44,280 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:44,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:44,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-12-03 15:08:44,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:44,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:44,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:44,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:44,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:44,751 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 15:08:44,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:44,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:44,752 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 15:08:44,752 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [36], [37], [45], [47], [50] [2018-12-03 15:08:44,753 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:44,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:44,794 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:44,797 INFO L272 AbstractInterpreter]: Visited 11 different actions 22 times. Merged at 7 different actions 8 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:08:44,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:44,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:44,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:44,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:44,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:44,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:44,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:45,206 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 15:08:45,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:45,404 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 15:08:45,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:45,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-12-03 15:08:45,424 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:45,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:45,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:45,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:45,425 INFO L87 Difference]: Start difference. First operand 449 states and 788 transitions. Second operand 9 states. [2018-12-03 15:08:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:45,932 INFO L93 Difference]: Finished difference Result 519 states and 895 transitions. [2018-12-03 15:08:45,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:08:45,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-12-03 15:08:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:45,935 INFO L225 Difference]: With dead ends: 519 [2018-12-03 15:08:45,935 INFO L226 Difference]: Without dead ends: 517 [2018-12-03 15:08:45,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:08:45,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-12-03 15:08:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 453. [2018-12-03 15:08:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-12-03 15:08:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 794 transitions. [2018-12-03 15:08:46,036 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 794 transitions. Word has length 11 [2018-12-03 15:08:46,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:46,037 INFO L480 AbstractCegarLoop]: Abstraction has 453 states and 794 transitions. [2018-12-03 15:08:46,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 794 transitions. [2018-12-03 15:08:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:08:46,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:46,038 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:46,038 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:46,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:46,038 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-12-03 15:08:46,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:46,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:46,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:46,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:46,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:46,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:46,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:46,180 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 15:08:46,180 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [38], [41], [45], [46], [47], [50] [2018-12-03 15:08:46,181 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:46,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:46,215 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:46,216 INFO L272 AbstractInterpreter]: Visited 10 different actions 21 times. Merged at 7 different actions 8 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:08:46,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:46,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:46,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:46,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:46,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:46,235 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:46,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:46,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:46,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:46,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 16 [2018-12-03 15:08:46,541 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:46,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:08:46,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:08:46,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:08:46,542 INFO L87 Difference]: Start difference. First operand 453 states and 794 transitions. Second operand 13 states. [2018-12-03 15:08:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:47,621 INFO L93 Difference]: Finished difference Result 595 states and 1010 transitions. [2018-12-03 15:08:47,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:08:47,622 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-12-03 15:08:47,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:47,624 INFO L225 Difference]: With dead ends: 595 [2018-12-03 15:08:47,624 INFO L226 Difference]: Without dead ends: 593 [2018-12-03 15:08:47,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:08:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-12-03 15:08:47,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 477. [2018-12-03 15:08:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-12-03 15:08:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 837 transitions. [2018-12-03 15:08:47,742 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 837 transitions. Word has length 11 [2018-12-03 15:08:47,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:47,742 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 837 transitions. [2018-12-03 15:08:47,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:08:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 837 transitions. [2018-12-03 15:08:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:08:47,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:47,743 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:47,744 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:47,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:47,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-12-03 15:08:47,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:47,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:47,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:47,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:47,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:47,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:47,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:47,888 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:47,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:08:47,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:47,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:47,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:08:47,897 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:08:47,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:08:47,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:08:47,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:47,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:47,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:47,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:47,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 15:08:47,950 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:47,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:08:47,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:08:47,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:08:47,951 INFO L87 Difference]: Start difference. First operand 477 states and 837 transitions. Second operand 7 states. [2018-12-03 15:08:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:48,386 INFO L93 Difference]: Finished difference Result 564 states and 971 transitions. [2018-12-03 15:08:48,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:08:48,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 15:08:48,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:48,391 INFO L225 Difference]: With dead ends: 564 [2018-12-03 15:08:48,391 INFO L226 Difference]: Without dead ends: 562 [2018-12-03 15:08:48,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:08:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-12-03 15:08:48,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 472. [2018-12-03 15:08:48,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-12-03 15:08:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 829 transitions. [2018-12-03 15:08:48,507 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 829 transitions. Word has length 11 [2018-12-03 15:08:48,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:48,508 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 829 transitions. [2018-12-03 15:08:48,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:08:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 829 transitions. [2018-12-03 15:08:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:08:48,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:48,509 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:48,509 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:48,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:48,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-12-03 15:08:48,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:48,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:48,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:08:48,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:48,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:48,584 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 15:08:48,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:48,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:48,584 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 15:08:48,584 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [23], [45], [47], [50], [52] [2018-12-03 15:08:48,585 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:48,585 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:48,591 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:48,592 INFO L272 AbstractInterpreter]: Visited 9 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:08:48,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:48,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:48,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:48,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:48,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:48,626 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:48,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:48,648 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 15:08:48,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:48,685 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 15:08:48,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:48,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 15:08:48,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:48,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:08:48,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:08:48,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:08:48,704 INFO L87 Difference]: Start difference. First operand 472 states and 829 transitions. Second operand 7 states. [2018-12-03 15:08:49,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:49,250 INFO L93 Difference]: Finished difference Result 581 states and 1007 transitions. [2018-12-03 15:08:49,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:08:49,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 15:08:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:49,252 INFO L225 Difference]: With dead ends: 581 [2018-12-03 15:08:49,252 INFO L226 Difference]: Without dead ends: 579 [2018-12-03 15:08:49,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:08:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-12-03 15:08:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 497. [2018-12-03 15:08:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-12-03 15:08:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 873 transitions. [2018-12-03 15:08:49,339 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 873 transitions. Word has length 11 [2018-12-03 15:08:49,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:49,340 INFO L480 AbstractCegarLoop]: Abstraction has 497 states and 873 transitions. [2018-12-03 15:08:49,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:08:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 873 transitions. [2018-12-03 15:08:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:08:49,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:49,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:49,341 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:49,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:49,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-12-03 15:08:49,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:49,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:49,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:49,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:49,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:49,437 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 15:08:49,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:49,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:49,438 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 15:08:49,438 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [36], [38], [41], [45], [46] [2018-12-03 15:08:49,440 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:49,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:49,454 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:49,454 INFO L272 AbstractInterpreter]: Visited 11 different actions 22 times. Merged at 7 different actions 8 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:08:49,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:49,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:49,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:49,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:49,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:49,472 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:49,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:49,480 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 15:08:49,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:49,509 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 15:08:49,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:49,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 15:08:49,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:49,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:08:49,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:08:49,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:08:49,530 INFO L87 Difference]: Start difference. First operand 497 states and 873 transitions. Second operand 7 states. [2018-12-03 15:08:49,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:49,868 INFO L93 Difference]: Finished difference Result 543 states and 936 transitions. [2018-12-03 15:08:49,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:08:49,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 15:08:49,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:49,870 INFO L225 Difference]: With dead ends: 543 [2018-12-03 15:08:49,870 INFO L226 Difference]: Without dead ends: 541 [2018-12-03 15:08:49,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:08:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-12-03 15:08:49,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 502. [2018-12-03 15:08:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-12-03 15:08:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 880 transitions. [2018-12-03 15:08:49,964 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 880 transitions. Word has length 11 [2018-12-03 15:08:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:49,964 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 880 transitions. [2018-12-03 15:08:49,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:08:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 880 transitions. [2018-12-03 15:08:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:08:49,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:49,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:49,965 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:49,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:49,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-12-03 15:08:49,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:49,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:49,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:49,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:49,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:50,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:50,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:50,050 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 15:08:50,050 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [23], [25], [27], [30], [45], [47], [52] [2018-12-03 15:08:50,051 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:50,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:50,059 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:50,059 INFO L272 AbstractInterpreter]: Visited 11 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:08:50,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:50,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:50,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:50,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:50,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:50,082 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:50,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:50,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:50,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:50,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 15:08:50,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:50,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:08:50,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:08:50,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:08:50,141 INFO L87 Difference]: Start difference. First operand 502 states and 880 transitions. Second operand 7 states. [2018-12-03 15:08:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:50,565 INFO L93 Difference]: Finished difference Result 571 states and 986 transitions. [2018-12-03 15:08:50,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:08:50,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 15:08:50,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:50,567 INFO L225 Difference]: With dead ends: 571 [2018-12-03 15:08:50,567 INFO L226 Difference]: Without dead ends: 569 [2018-12-03 15:08:50,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:08:50,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-12-03 15:08:50,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 489. [2018-12-03 15:08:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-12-03 15:08:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 855 transitions. [2018-12-03 15:08:50,660 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 855 transitions. Word has length 11 [2018-12-03 15:08:50,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:50,660 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 855 transitions. [2018-12-03 15:08:50,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:08:50,660 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 855 transitions. [2018-12-03 15:08:50,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:08:50,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:50,661 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:50,661 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:50,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:50,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-12-03 15:08:50,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:50,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:50,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:50,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:50,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:50,739 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 15:08:50,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:50,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:50,740 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 15:08:50,740 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [25], [27], [30], [32] [2018-12-03 15:08:50,742 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:50,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:50,749 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:50,750 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 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 15:08:50,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:50,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:50,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:50,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:50,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:50,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:50,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:50,773 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 15:08:50,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:50,810 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 15:08:50,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:50,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 15:08:50,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:50,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:08:50,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:08:50,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:08:50,830 INFO L87 Difference]: Start difference. First operand 489 states and 855 transitions. Second operand 7 states. [2018-12-03 15:08:51,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:51,231 INFO L93 Difference]: Finished difference Result 561 states and 969 transitions. [2018-12-03 15:08:51,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:08:51,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 15:08:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:51,233 INFO L225 Difference]: With dead ends: 561 [2018-12-03 15:08:51,233 INFO L226 Difference]: Without dead ends: 559 [2018-12-03 15:08:51,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:08:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-12-03 15:08:51,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 483. [2018-12-03 15:08:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-12-03 15:08:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 840 transitions. [2018-12-03 15:08:51,316 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 840 transitions. Word has length 11 [2018-12-03 15:08:51,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:51,317 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 840 transitions. [2018-12-03 15:08:51,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:08:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 840 transitions. [2018-12-03 15:08:51,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:51,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:51,318 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:51,318 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:51,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:51,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-12-03 15:08:51,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:51,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:51,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:51,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:51,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:51,575 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 15:08:51,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:51,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:51,576 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-12-03 15:08:51,576 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [36], [38], [43], [45], [47], [52] [2018-12-03 15:08:51,577 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:51,577 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:51,585 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:51,585 INFO L272 AbstractInterpreter]: Visited 11 different actions 17 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 15:08:51,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:51,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:51,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:51,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:51,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:51,623 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:51,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:51,693 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 15:08:51,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:51,742 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 15:08:51,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:51,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2018-12-03 15:08:51,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:51,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:08:51,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:08:51,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:08:51,763 INFO L87 Difference]: Start difference. First operand 483 states and 840 transitions. Second operand 12 states. [2018-12-03 15:08:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:52,688 INFO L93 Difference]: Finished difference Result 835 states and 1449 transitions. [2018-12-03 15:08:52,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:08:52,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 15:08:52,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:52,692 INFO L225 Difference]: With dead ends: 835 [2018-12-03 15:08:52,693 INFO L226 Difference]: Without dead ends: 833 [2018-12-03 15:08:52,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:08:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2018-12-03 15:08:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 625. [2018-12-03 15:08:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-12-03 15:08:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1098 transitions. [2018-12-03 15:08:52,824 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1098 transitions. Word has length 12 [2018-12-03 15:08:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:52,824 INFO L480 AbstractCegarLoop]: Abstraction has 625 states and 1098 transitions. [2018-12-03 15:08:52,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:08:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1098 transitions. [2018-12-03 15:08:52,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:52,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:52,825 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:52,825 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:52,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:52,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-12-03 15:08:52,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:52,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:52,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:52,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:52,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:53,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:53,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:53,041 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-12-03 15:08:53,041 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [32], [36], [37] [2018-12-03 15:08:53,042 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:53,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:53,049 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:53,050 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 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 15:08:53,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:53,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:53,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:53,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:53,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:53,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:53,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:53,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:53,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:53,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:53,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-12-03 15:08:53,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:53,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:08:53,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:08:53,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:08:53,306 INFO L87 Difference]: Start difference. First operand 625 states and 1098 transitions. Second operand 13 states. [2018-12-03 15:08:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:54,624 INFO L93 Difference]: Finished difference Result 1141 states and 1993 transitions. [2018-12-03 15:08:54,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:08:54,624 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 15:08:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:54,628 INFO L225 Difference]: With dead ends: 1141 [2018-12-03 15:08:54,628 INFO L226 Difference]: Without dead ends: 1139 [2018-12-03 15:08:54,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=392, Invalid=1414, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:08:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2018-12-03 15:08:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 822. [2018-12-03 15:08:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2018-12-03 15:08:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1443 transitions. [2018-12-03 15:08:54,794 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1443 transitions. Word has length 12 [2018-12-03 15:08:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:54,794 INFO L480 AbstractCegarLoop]: Abstraction has 822 states and 1443 transitions. [2018-12-03 15:08:54,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:08:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1443 transitions. [2018-12-03 15:08:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:08:54,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:54,795 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:54,796 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:54,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:54,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1489044045, now seen corresponding path program 1 times [2018-12-03 15:08:54,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:54,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:54,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:54,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:54,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:54,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:54,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:54,872 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 15:08:54,872 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [27], [30], [36], [38], [41], [43] [2018-12-03 15:08:54,873 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:54,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:54,879 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:54,879 INFO L272 AbstractInterpreter]: Visited 11 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:08:54,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:54,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:54,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:54,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:54,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:54,917 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:54,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:54,958 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 15:08:54,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:55,006 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 15:08:55,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:55,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2018-12-03 15:08:55,025 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:55,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:08:55,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:08:55,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:08:55,026 INFO L87 Difference]: Start difference. First operand 822 states and 1443 transitions. Second operand 12 states. [2018-12-03 15:08:55,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:55,836 INFO L93 Difference]: Finished difference Result 949 states and 1651 transitions. [2018-12-03 15:08:55,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:08:55,836 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-12-03 15:08:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:55,839 INFO L225 Difference]: With dead ends: 949 [2018-12-03 15:08:55,839 INFO L226 Difference]: Without dead ends: 947 [2018-12-03 15:08:55,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:08:55,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-12-03 15:08:55,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 820. [2018-12-03 15:08:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-12-03 15:08:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1443 transitions. [2018-12-03 15:08:55,996 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1443 transitions. Word has length 14 [2018-12-03 15:08:55,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:55,997 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 1443 transitions. [2018-12-03 15:08:55,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:08:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1443 transitions. [2018-12-03 15:08:55,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:08:55,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:55,998 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:55,998 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:55,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:55,998 INFO L82 PathProgramCache]: Analyzing trace with hash -397032175, now seen corresponding path program 2 times [2018-12-03 15:08:55,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:55,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:55,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:55,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:55,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:08:56,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:56,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:56,118 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:56,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:08:56,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:56,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:56,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:08:56,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:08:56,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:08:56,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:08:56,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:08:56,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:08:56,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:56,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-03 15:08:56,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:56,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:08:56,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:08:56,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:08:56,255 INFO L87 Difference]: Start difference. First operand 820 states and 1443 transitions. Second operand 11 states. [2018-12-03 15:08:57,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:57,324 INFO L93 Difference]: Finished difference Result 997 states and 1741 transitions. [2018-12-03 15:08:57,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:08:57,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-12-03 15:08:57,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:57,328 INFO L225 Difference]: With dead ends: 997 [2018-12-03 15:08:57,329 INFO L226 Difference]: Without dead ends: 994 [2018-12-03 15:08:57,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:08:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-12-03 15:08:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 860. [2018-12-03 15:08:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-12-03 15:08:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1513 transitions. [2018-12-03 15:08:57,537 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1513 transitions. Word has length 14 [2018-12-03 15:08:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:57,537 INFO L480 AbstractCegarLoop]: Abstraction has 860 states and 1513 transitions. [2018-12-03 15:08:57,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:08:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1513 transitions. [2018-12-03 15:08:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:08:57,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:57,538 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:57,538 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:57,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:57,539 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-12-03 15:08:57,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:57,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:57,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:08:57,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:57,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:57,607 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 15:08:57,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:57,608 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:57,608 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 15:08:57,608 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [36], [38], [41], [43], [45], [47], [50] [2018-12-03 15:08:57,609 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:57,609 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:57,621 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:57,621 INFO L272 AbstractInterpreter]: Visited 12 different actions 24 times. Merged at 7 different actions 8 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:08:57,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:57,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:57,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:57,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:57,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:57,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:57,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:57,715 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 15:08:57,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:57,799 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 15:08:57,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:57,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-03 15:08:57,822 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:57,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:08:57,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:08:57,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:08:57,823 INFO L87 Difference]: Start difference. First operand 860 states and 1513 transitions. Second operand 11 states. [2018-12-03 15:08:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:58,583 INFO L93 Difference]: Finished difference Result 961 states and 1671 transitions. [2018-12-03 15:08:58,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:08:58,583 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-12-03 15:08:58,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:58,587 INFO L225 Difference]: With dead ends: 961 [2018-12-03 15:08:58,587 INFO L226 Difference]: Without dead ends: 959 [2018-12-03 15:08:58,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:08:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2018-12-03 15:08:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 854. [2018-12-03 15:08:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-12-03 15:08:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1503 transitions. [2018-12-03 15:08:58,765 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1503 transitions. Word has length 14 [2018-12-03 15:08:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:58,765 INFO L480 AbstractCegarLoop]: Abstraction has 854 states and 1503 transitions. [2018-12-03 15:08:58,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:08:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1503 transitions. [2018-12-03 15:08:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:08:58,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:58,766 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:58,767 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:58,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:58,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-12-03 15:08:58,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:58,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:58,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:58,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:58,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:58,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:58,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:58,873 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 15:08:58,873 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [27], [30], [36], [38], [43] [2018-12-03 15:08:58,874 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:58,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:58,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:58,884 INFO L272 AbstractInterpreter]: Visited 13 different actions 17 times. Merged at 3 different actions 3 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:08:58,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:58,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:58,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:58,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:58,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:58,926 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:58,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:58,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:58,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:59,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:59,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2018-12-03 15:08:59,044 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:59,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:08:59,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:08:59,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:08:59,045 INFO L87 Difference]: Start difference. First operand 854 states and 1503 transitions. Second operand 12 states. [2018-12-03 15:08:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:59,905 INFO L93 Difference]: Finished difference Result 1073 states and 1863 transitions. [2018-12-03 15:08:59,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:08:59,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-12-03 15:08:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:59,909 INFO L225 Difference]: With dead ends: 1073 [2018-12-03 15:08:59,909 INFO L226 Difference]: Without dead ends: 1071 [2018-12-03 15:08:59,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:08:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-12-03 15:09:00,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 848. [2018-12-03 15:09:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2018-12-03 15:09:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1495 transitions. [2018-12-03 15:09:00,089 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1495 transitions. Word has length 14 [2018-12-03 15:09:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:00,089 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 1495 transitions. [2018-12-03 15:09:00,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:09:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1495 transitions. [2018-12-03 15:09:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:09:00,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:00,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:00,090 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:00,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:00,090 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-12-03 15:09:00,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:00,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:00,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:00,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:00,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:00,162 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 15:09:00,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:00,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:00,163 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 15:09:00,163 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [36], [38], [43], [45], [47], [50] [2018-12-03 15:09:00,164 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:00,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:00,176 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:00,176 INFO L272 AbstractInterpreter]: Visited 14 different actions 27 times. Merged at 8 different actions 9 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:09:00,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:00,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:00,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:00,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:00,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:00,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:00,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:00,237 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 15:09:00,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:00,297 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 15:09:00,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:00,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-03 15:09:00,319 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:00,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:09:00,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:09:00,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:09:00,320 INFO L87 Difference]: Start difference. First operand 848 states and 1495 transitions. Second operand 11 states. [2018-12-03 15:09:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:01,072 INFO L93 Difference]: Finished difference Result 959 states and 1654 transitions. [2018-12-03 15:09:01,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:09:01,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-12-03 15:09:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:01,076 INFO L225 Difference]: With dead ends: 959 [2018-12-03 15:09:01,076 INFO L226 Difference]: Without dead ends: 957 [2018-12-03 15:09:01,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:09:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2018-12-03 15:09:01,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 842. [2018-12-03 15:09:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2018-12-03 15:09:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1483 transitions. [2018-12-03 15:09:01,257 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1483 transitions. Word has length 14 [2018-12-03 15:09:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:01,257 INFO L480 AbstractCegarLoop]: Abstraction has 842 states and 1483 transitions. [2018-12-03 15:09:01,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:09:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1483 transitions. [2018-12-03 15:09:01,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:09:01,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:01,259 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:09:01,259 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:01,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:01,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 1 times [2018-12-03 15:09:01,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:01,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:01,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:01,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:01,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:01,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:01,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:01,505 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 15:09:01,505 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [38], [41], [45], [46], [47], [52] [2018-12-03 15:09:01,506 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:01,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:01,531 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:01,531 INFO L272 AbstractInterpreter]: Visited 10 different actions 23 times. Merged at 8 different actions 10 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:09:01,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:01,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:01,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:01,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:01,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:01,568 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:01,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:01,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:02,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 15:09:02,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 8] total 22 [2018-12-03 15:09:02,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:02,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:09:02,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:09:02,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:09:02,283 INFO L87 Difference]: Start difference. First operand 842 states and 1483 transitions. Second operand 8 states. [2018-12-03 15:09:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:02,764 INFO L93 Difference]: Finished difference Result 1851 states and 3241 transitions. [2018-12-03 15:09:02,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:09:02,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-03 15:09:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:02,768 INFO L225 Difference]: With dead ends: 1851 [2018-12-03 15:09:02,768 INFO L226 Difference]: Without dead ends: 1010 [2018-12-03 15:09:02,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:09:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2018-12-03 15:09:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 945. [2018-12-03 15:09:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2018-12-03 15:09:02,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1641 transitions. [2018-12-03 15:09:02,989 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1641 transitions. Word has length 15 [2018-12-03 15:09:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:02,989 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 1641 transitions. [2018-12-03 15:09:02,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:09:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1641 transitions. [2018-12-03 15:09:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:09:02,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:02,991 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:02,991 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:02,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:02,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1084233543, now seen corresponding path program 1 times [2018-12-03 15:09:02,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:02,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:02,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:02,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:02,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:03,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:03,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:03,122 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 15:09:03,122 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [25], [26], [27], [32], [36], [38], [41], [43] [2018-12-03 15:09:03,123 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:03,123 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:03,140 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:03,140 INFO L272 AbstractInterpreter]: Visited 12 different actions 30 times. Merged at 11 different actions 15 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:09:03,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:03,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:03,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:03,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:03,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:03,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:03,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:03,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:03,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 15:09:03,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 18 [2018-12-03 15:09:03,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:03,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:09:03,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:09:03,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:09:03,353 INFO L87 Difference]: Start difference. First operand 945 states and 1641 transitions. Second operand 7 states. [2018-12-03 15:09:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:03,923 INFO L93 Difference]: Finished difference Result 2006 states and 3469 transitions. [2018-12-03 15:09:03,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:09:03,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 15:09:03,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:03,927 INFO L225 Difference]: With dead ends: 2006 [2018-12-03 15:09:03,928 INFO L226 Difference]: Without dead ends: 1062 [2018-12-03 15:09:03,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:09:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2018-12-03 15:09:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 901. [2018-12-03 15:09:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-03 15:09:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1554 transitions. [2018-12-03 15:09:04,145 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1554 transitions. Word has length 15 [2018-12-03 15:09:04,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:04,145 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1554 transitions. [2018-12-03 15:09:04,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:09:04,145 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1554 transitions. [2018-12-03 15:09:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:09:04,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:04,146 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:04,146 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:04,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:04,147 INFO L82 PathProgramCache]: Analyzing trace with hash -2133386956, now seen corresponding path program 1 times [2018-12-03 15:09:04,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:04,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:04,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:04,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:04,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:04,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:04,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:04,763 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 15:09:04,763 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [23], [36], [38], [41], [43], [45], [46], [47], [50] [2018-12-03 15:09:04,764 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:04,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:04,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:04,776 INFO L272 AbstractInterpreter]: Visited 12 different actions 25 times. Merged at 8 different actions 9 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:09:04,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:04,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:04,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:04,812 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:04,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:04,825 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:04,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:04,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:05,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:05,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:05,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2018-12-03 15:09:05,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:05,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:09:05,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:09:05,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:09:05,067 INFO L87 Difference]: Start difference. First operand 901 states and 1554 transitions. Second operand 12 states. [2018-12-03 15:09:06,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:06,285 INFO L93 Difference]: Finished difference Result 1069 states and 1801 transitions. [2018-12-03 15:09:06,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:09:06,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-12-03 15:09:06,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:06,289 INFO L225 Difference]: With dead ends: 1069 [2018-12-03 15:09:06,289 INFO L226 Difference]: Without dead ends: 1067 [2018-12-03 15:09:06,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=317, Invalid=1165, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:09:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-12-03 15:09:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 867. [2018-12-03 15:09:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2018-12-03 15:09:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1492 transitions. [2018-12-03 15:09:06,545 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1492 transitions. Word has length 15 [2018-12-03 15:09:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:06,546 INFO L480 AbstractCegarLoop]: Abstraction has 867 states and 1492 transitions. [2018-12-03 15:09:06,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:09:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1492 transitions. [2018-12-03 15:09:06,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:09:06,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:06,547 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:06,547 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:06,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:06,548 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-12-03 15:09:06,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:06,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:06,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:06,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:06,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:06,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:06,700 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:06,700 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 15:09:06,700 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [36], [38], [43], [45], [47], [52] [2018-12-03 15:09:06,701 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:06,701 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:06,719 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:06,719 INFO L272 AbstractInterpreter]: Visited 14 different actions 33 times. Merged at 10 different actions 13 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 15:09:06,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:06,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:06,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:06,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:06,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:06,769 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:06,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:07,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:07,174 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 15:09:07,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 15:09:07,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 17 [2018-12-03 15:09:07,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:07,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:09:07,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:09:07,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:09:07,198 INFO L87 Difference]: Start difference. First operand 867 states and 1492 transitions. Second operand 7 states. [2018-12-03 15:09:07,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:07,696 INFO L93 Difference]: Finished difference Result 2080 states and 3524 transitions. [2018-12-03 15:09:07,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:09:07,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 15:09:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:07,701 INFO L225 Difference]: With dead ends: 2080 [2018-12-03 15:09:07,701 INFO L226 Difference]: Without dead ends: 1203 [2018-12-03 15:09:07,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:09:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2018-12-03 15:09:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 978. [2018-12-03 15:09:07,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2018-12-03 15:09:07,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1642 transitions. [2018-12-03 15:09:07,958 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1642 transitions. Word has length 15 [2018-12-03 15:09:07,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:07,958 INFO L480 AbstractCegarLoop]: Abstraction has 978 states and 1642 transitions. [2018-12-03 15:09:07,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:09:07,958 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1642 transitions. [2018-12-03 15:09:07,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:09:07,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:07,959 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:07,960 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:07,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:07,960 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-12-03 15:09:07,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:07,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:07,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:07,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:07,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:08,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:08,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:08,427 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 15:09:08,428 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [38], [41], [43], [45], [46], [47], [50] [2018-12-03 15:09:08,428 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:08,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:08,439 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:08,439 INFO L272 AbstractInterpreter]: Visited 11 different actions 25 times. Merged at 8 different actions 10 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:09:08,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:08,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:08,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:08,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:08,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:08,491 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:08,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:09:08,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:09:08,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:08,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2018-12-03 15:09:08,742 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:08,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:09:08,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:09:08,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:09:08,743 INFO L87 Difference]: Start difference. First operand 978 states and 1642 transitions. Second operand 15 states. [2018-12-03 15:09:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:12,534 INFO L93 Difference]: Finished difference Result 2928 states and 4860 transitions. [2018-12-03 15:09:12,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:09:12,535 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 15:09:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:12,545 INFO L225 Difference]: With dead ends: 2928 [2018-12-03 15:09:12,546 INFO L226 Difference]: Without dead ends: 2232 [2018-12-03 15:09:12,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2061 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1422, Invalid=5384, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:09:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2018-12-03 15:09:13,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 1663. [2018-12-03 15:09:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1663 states. [2018-12-03 15:09:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2708 transitions. [2018-12-03 15:09:13,367 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2708 transitions. Word has length 15 [2018-12-03 15:09:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:13,367 INFO L480 AbstractCegarLoop]: Abstraction has 1663 states and 2708 transitions. [2018-12-03 15:09:13,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:09:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2708 transitions. [2018-12-03 15:09:13,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:09:13,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:13,369 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:09:13,369 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:13,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:13,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-12-03 15:09:13,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:13,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:13,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:13,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:13,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:13,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:13,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:13,643 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 15:09:13,643 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [37], [38], [43], [45], [47], [50] [2018-12-03 15:09:13,644 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:13,644 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:13,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:13,654 INFO L272 AbstractInterpreter]: Visited 10 different actions 23 times. Merged at 8 different actions 10 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:09:13,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:13,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:13,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:13,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:13,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:13,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:13,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:13,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:13,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 15:09:13,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 8] total 19 [2018-12-03 15:09:13,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:13,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:09:13,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:09:13,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:09:13,856 INFO L87 Difference]: Start difference. First operand 1663 states and 2708 transitions. Second operand 7 states. [2018-12-03 15:09:14,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:14,472 INFO L93 Difference]: Finished difference Result 2237 states and 3574 transitions. [2018-12-03 15:09:14,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:09:14,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 15:09:14,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:14,479 INFO L225 Difference]: With dead ends: 2237 [2018-12-03 15:09:14,479 INFO L226 Difference]: Without dead ends: 1609 [2018-12-03 15:09:14,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:09:14,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2018-12-03 15:09:14,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1373. [2018-12-03 15:09:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2018-12-03 15:09:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2243 transitions. [2018-12-03 15:09:14,915 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2243 transitions. Word has length 15 [2018-12-03 15:09:14,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:14,915 INFO L480 AbstractCegarLoop]: Abstraction has 1373 states and 2243 transitions. [2018-12-03 15:09:14,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:09:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2243 transitions. [2018-12-03 15:09:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:09:14,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:14,916 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:14,916 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:14,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:14,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1386290021, now seen corresponding path program 1 times [2018-12-03 15:09:14,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:14,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:14,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:14,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:14,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:15,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:15,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:15,025 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 15:09:15,025 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [23], [36], [38], [43], [45], [47], [50], [52] [2018-12-03 15:09:15,026 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:15,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:15,036 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:15,036 INFO L272 AbstractInterpreter]: Visited 12 different actions 26 times. Merged at 8 different actions 10 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:09:15,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:15,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:15,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:15,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:15,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:15,088 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:15,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:15,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:15,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:15,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 15:09:15,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2018-12-03 15:09:15,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:15,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:09:15,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:09:15,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:09:15,279 INFO L87 Difference]: Start difference. First operand 1373 states and 2243 transitions. Second operand 7 states. [2018-12-03 15:09:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:16,218 INFO L93 Difference]: Finished difference Result 3043 states and 4935 transitions. [2018-12-03 15:09:16,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:09:16,218 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 15:09:16,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:16,224 INFO L225 Difference]: With dead ends: 3043 [2018-12-03 15:09:16,224 INFO L226 Difference]: Without dead ends: 1528 [2018-12-03 15:09:16,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:09:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2018-12-03 15:09:16,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1369. [2018-12-03 15:09:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-12-03 15:09:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2220 transitions. [2018-12-03 15:09:16,736 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2220 transitions. Word has length 15 [2018-12-03 15:09:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:16,736 INFO L480 AbstractCegarLoop]: Abstraction has 1369 states and 2220 transitions. [2018-12-03 15:09:16,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:09:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2220 transitions. [2018-12-03 15:09:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:09:16,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:16,738 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:09:16,738 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:16,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:16,738 INFO L82 PathProgramCache]: Analyzing trace with hash -38293542, now seen corresponding path program 1 times [2018-12-03 15:09:16,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:16,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:16,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:16,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:16,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:16,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:16,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:16,863 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 15:09:16,863 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [26], [27], [30], [36], [38], [43] [2018-12-03 15:09:16,864 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:16,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:16,875 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:16,875 INFO L272 AbstractInterpreter]: Visited 10 different actions 24 times. Merged at 8 different actions 11 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:09:16,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:16,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:16,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:16,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:16,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:16,915 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:16,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:17,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:17,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 15:09:17,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 17 [2018-12-03 15:09:17,191 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:17,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:09:17,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:09:17,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:09:17,192 INFO L87 Difference]: Start difference. First operand 1369 states and 2220 transitions. Second operand 7 states. [2018-12-03 15:09:17,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:17,811 INFO L93 Difference]: Finished difference Result 2968 states and 4750 transitions. [2018-12-03 15:09:17,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:09:17,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 15:09:17,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:17,814 INFO L225 Difference]: With dead ends: 2968 [2018-12-03 15:09:17,815 INFO L226 Difference]: Without dead ends: 1345 [2018-12-03 15:09:17,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:09:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-12-03 15:09:18,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1010. [2018-12-03 15:09:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2018-12-03 15:09:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1626 transitions. [2018-12-03 15:09:18,088 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1626 transitions. Word has length 15 [2018-12-03 15:09:18,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:18,088 INFO L480 AbstractCegarLoop]: Abstraction has 1010 states and 1626 transitions. [2018-12-03 15:09:18,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:09:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1626 transitions. [2018-12-03 15:09:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:09:18,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:18,089 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:09:18,089 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:18,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:18,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1080543844, now seen corresponding path program 1 times [2018-12-03 15:09:18,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:18,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:18,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:18,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:18,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:18,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:18,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:18,324 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 15:09:18,324 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [38], [41], [45], [46], [47], [50], [52] [2018-12-03 15:09:18,324 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:18,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:18,334 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:18,334 INFO L272 AbstractInterpreter]: Visited 11 different actions 25 times. Merged at 8 different actions 10 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:09:18,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:18,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:18,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:18,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:18,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:18,377 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:18,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:18,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:18,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:18,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2018-12-03 15:09:18,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:18,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:09:18,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:09:18,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:09:18,643 INFO L87 Difference]: Start difference. First operand 1010 states and 1626 transitions. Second operand 19 states. [2018-12-03 15:09:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:21,187 INFO L93 Difference]: Finished difference Result 2204 states and 3532 transitions. [2018-12-03 15:09:21,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:09:21,187 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 15:09:21,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:21,190 INFO L225 Difference]: With dead ends: 2204 [2018-12-03 15:09:21,190 INFO L226 Difference]: Without dead ends: 1512 [2018-12-03 15:09:21,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=696, Invalid=3464, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:09:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2018-12-03 15:09:21,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1371. [2018-12-03 15:09:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2018-12-03 15:09:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2170 transitions. [2018-12-03 15:09:21,602 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2170 transitions. Word has length 18 [2018-12-03 15:09:21,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:21,602 INFO L480 AbstractCegarLoop]: Abstraction has 1371 states and 2170 transitions. [2018-12-03 15:09:21,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:09:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2170 transitions. [2018-12-03 15:09:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:09:21,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:21,604 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:21,604 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:21,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:21,604 INFO L82 PathProgramCache]: Analyzing trace with hash 818532565, now seen corresponding path program 1 times [2018-12-03 15:09:21,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:21,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:21,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:21,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:21,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:21,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:21,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:21,990 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 15:09:21,990 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [25], [26], [27], [30], [32], [36], [38], [41], [43] [2018-12-03 15:09:21,991 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:21,991 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:22,004 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:22,004 INFO L272 AbstractInterpreter]: Visited 13 different actions 32 times. Merged at 11 different actions 15 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 15:09:22,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:22,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:22,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:22,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:22,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:22,064 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:22,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:22,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:22,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:22,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2018-12-03 15:09:22,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:22,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:09:22,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:09:22,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:09:22,634 INFO L87 Difference]: Start difference. First operand 1371 states and 2170 transitions. Second operand 19 states. [2018-12-03 15:09:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:25,278 INFO L93 Difference]: Finished difference Result 1470 states and 2323 transitions. [2018-12-03 15:09:25,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:09:25,278 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 15:09:25,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:25,280 INFO L225 Difference]: With dead ends: 1470 [2018-12-03 15:09:25,280 INFO L226 Difference]: Without dead ends: 1468 [2018-12-03 15:09:25,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=608, Invalid=3174, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:09:25,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2018-12-03 15:09:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1360. [2018-12-03 15:09:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2018-12-03 15:09:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2154 transitions. [2018-12-03 15:09:25,671 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2154 transitions. Word has length 18 [2018-12-03 15:09:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:25,671 INFO L480 AbstractCegarLoop]: Abstraction has 1360 states and 2154 transitions. [2018-12-03 15:09:25,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:09:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2154 transitions. [2018-12-03 15:09:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:09:25,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:25,672 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:09:25,672 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:25,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:25,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1793898800, now seen corresponding path program 2 times [2018-12-03 15:09:25,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:25,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:25,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:25,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:25,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:09:25,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:25,785 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:25,785 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:09:25,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:09:25,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:25,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 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 15:09:25,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:09:25,795 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:09:25,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:09:25,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:09:25,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:25,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 15:09:25,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 15:09:26,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:26,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2018-12-03 15:09:26,624 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:26,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:09:26,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:09:26,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:09:26,625 INFO L87 Difference]: Start difference. First operand 1360 states and 2154 transitions. Second operand 20 states. [2018-12-03 15:09:26,956 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-12-03 15:09:28,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:28,919 INFO L93 Difference]: Finished difference Result 1557 states and 2459 transitions. [2018-12-03 15:09:28,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:09:28,920 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-12-03 15:09:28,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:28,922 INFO L225 Difference]: With dead ends: 1557 [2018-12-03 15:09:28,922 INFO L226 Difference]: Without dead ends: 1556 [2018-12-03 15:09:28,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=593, Invalid=1957, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:09:28,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-12-03 15:09:29,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1353. [2018-12-03 15:09:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2018-12-03 15:09:29,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2139 transitions. [2018-12-03 15:09:29,423 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2139 transitions. Word has length 18 [2018-12-03 15:09:29,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:29,423 INFO L480 AbstractCegarLoop]: Abstraction has 1353 states and 2139 transitions. [2018-12-03 15:09:29,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:09:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2139 transitions. [2018-12-03 15:09:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:09:29,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:29,424 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:29,424 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:29,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:29,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1793897518, now seen corresponding path program 1 times [2018-12-03 15:09:29,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:29,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:29,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:09:29,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:29,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:29,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:29,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:29,522 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 15:09:29,522 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 15:09:29,523 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:29,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:29,534 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:29,534 INFO L272 AbstractInterpreter]: Visited 13 different actions 28 times. Merged at 8 different actions 10 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 15:09:29,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:29,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:29,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:29,563 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 15:09:29,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:29,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:29,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:29,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:29,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:29,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 15:09:29,791 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:29,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:09:29,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:09:29,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:09:29,792 INFO L87 Difference]: Start difference. First operand 1353 states and 2139 transitions. Second operand 16 states. [2018-12-03 15:09:32,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:32,479 INFO L93 Difference]: Finished difference Result 1659 states and 2632 transitions. [2018-12-03 15:09:32,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:09:32,479 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 15:09:32,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:32,482 INFO L225 Difference]: With dead ends: 1659 [2018-12-03 15:09:32,483 INFO L226 Difference]: Without dead ends: 1657 [2018-12-03 15:09:32,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1331 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=809, Invalid=4303, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:09:32,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2018-12-03 15:09:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1426. [2018-12-03 15:09:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1426 states. [2018-12-03 15:09:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2263 transitions. [2018-12-03 15:09:32,924 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2263 transitions. Word has length 18 [2018-12-03 15:09:32,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:32,924 INFO L480 AbstractCegarLoop]: Abstraction has 1426 states and 2263 transitions. [2018-12-03 15:09:32,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:09:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2263 transitions. [2018-12-03 15:09:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:09:32,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:32,925 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:32,925 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:32,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:32,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-12-03 15:09:32,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:32,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:32,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:32,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:32,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:33,152 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:33,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:33,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:33,152 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 15:09:33,152 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [37], [38], [41], [45], [47], [50], [52] [2018-12-03 15:09:33,153 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:33,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:33,163 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:33,163 INFO L272 AbstractInterpreter]: Visited 11 different actions 25 times. Merged at 8 different actions 10 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:09:33,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:33,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:33,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:33,199 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 15:09:33,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:33,216 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:33,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:33,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:33,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:33,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 15:09:33,478 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:33,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:09:33,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:09:33,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:09:33,479 INFO L87 Difference]: Start difference. First operand 1426 states and 2263 transitions. Second operand 15 states. [2018-12-03 15:09:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:36,469 INFO L93 Difference]: Finished difference Result 1712 states and 2716 transitions. [2018-12-03 15:09:36,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:09:36,469 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 15:09:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:36,474 INFO L225 Difference]: With dead ends: 1712 [2018-12-03 15:09:36,474 INFO L226 Difference]: Without dead ends: 1710 [2018-12-03 15:09:36,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=838, Invalid=3992, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:09:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2018-12-03 15:09:37,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1469. [2018-12-03 15:09:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-12-03 15:09:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2333 transitions. [2018-12-03 15:09:37,072 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2333 transitions. Word has length 18 [2018-12-03 15:09:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:37,072 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 2333 transitions. [2018-12-03 15:09:37,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:09:37,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2333 transitions. [2018-12-03 15:09:37,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:09:37,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:37,073 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:37,073 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:37,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-12-03 15:09:37,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:37,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:37,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:37,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:37,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:37,189 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:09:37,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:09:37,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:37,189 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 15:09:37,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:09:37,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:09:37,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:09:37,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:09:37,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:37,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:37,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:37,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 23 [2018-12-03 15:09:37,588 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:37,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:09:37,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:09:37,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:09:37,589 INFO L87 Difference]: Start difference. First operand 1469 states and 2333 transitions. Second operand 18 states. [2018-12-03 15:09:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:42,226 INFO L93 Difference]: Finished difference Result 1829 states and 2908 transitions. [2018-12-03 15:09:42,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 15:09:42,226 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 15:09:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:42,228 INFO L225 Difference]: With dead ends: 1829 [2018-12-03 15:09:42,228 INFO L226 Difference]: Without dead ends: 1827 [2018-12-03 15:09:42,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 3165 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2174, Invalid=7926, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 15:09:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2018-12-03 15:09:42,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1331. [2018-12-03 15:09:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-12-03 15:09:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2101 transitions. [2018-12-03 15:09:42,716 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2101 transitions. Word has length 18 [2018-12-03 15:09:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:42,716 INFO L480 AbstractCegarLoop]: Abstraction has 1331 states and 2101 transitions. [2018-12-03 15:09:42,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:09:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2101 transitions. [2018-12-03 15:09:42,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:09:42,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:42,717 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:42,717 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:42,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:42,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 2 times [2018-12-03 15:09:42,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:42,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:42,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:09:42,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:42,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:42,838 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:42,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:42,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:42,839 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:09:42,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:09:42,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:42,839 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 15:09:42,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:09:42,849 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:09:42,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:09:42,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:09:42,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:42,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:43,046 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:43,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:43,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 15:09:43,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:43,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:09:43,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:09:43,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:09:43,067 INFO L87 Difference]: Start difference. First operand 1331 states and 2101 transitions. Second operand 16 states. [2018-12-03 15:09:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:46,687 INFO L93 Difference]: Finished difference Result 1534 states and 2400 transitions. [2018-12-03 15:09:46,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:09:46,687 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 15:09:46,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:46,689 INFO L225 Difference]: With dead ends: 1534 [2018-12-03 15:09:46,689 INFO L226 Difference]: Without dead ends: 1532 [2018-12-03 15:09:46,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1726 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1425, Invalid=5381, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:09:46,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2018-12-03 15:09:47,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1329. [2018-12-03 15:09:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1329 states. [2018-12-03 15:09:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 2096 transitions. [2018-12-03 15:09:47,190 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 2096 transitions. Word has length 18 [2018-12-03 15:09:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:47,190 INFO L480 AbstractCegarLoop]: Abstraction has 1329 states and 2096 transitions. [2018-12-03 15:09:47,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:09:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 2096 transitions. [2018-12-03 15:09:47,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:09:47,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:47,191 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:47,191 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:47,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:47,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1882250372, now seen corresponding path program 1 times [2018-12-03 15:09:47,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:47,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:47,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:09:47,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:47,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:47,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:47,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:47,345 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 15:09:47,345 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [36], [38], [43], [45], [47], [50], [52] [2018-12-03 15:09:47,346 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:47,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:47,368 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:47,368 INFO L272 AbstractInterpreter]: Visited 15 different actions 35 times. Merged at 11 different actions 13 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 15:09:47,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:47,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:47,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:47,408 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 15:09:47,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:47,445 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:47,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:47,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:47,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:47,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:47,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 15:09:47,953 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:47,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:09:47,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:09:47,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:09:47,954 INFO L87 Difference]: Start difference. First operand 1329 states and 2096 transitions. Second operand 16 states. [2018-12-03 15:09:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:50,163 INFO L93 Difference]: Finished difference Result 1621 states and 2566 transitions. [2018-12-03 15:09:50,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:09:50,163 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 15:09:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:50,165 INFO L225 Difference]: With dead ends: 1621 [2018-12-03 15:09:50,165 INFO L226 Difference]: Without dead ends: 1619 [2018-12-03 15:09:50,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=387, Invalid=2265, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:09:50,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2018-12-03 15:09:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1312. [2018-12-03 15:09:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2018-12-03 15:09:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2065 transitions. [2018-12-03 15:09:50,640 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2065 transitions. Word has length 18 [2018-12-03 15:09:50,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:50,640 INFO L480 AbstractCegarLoop]: Abstraction has 1312 states and 2065 transitions. [2018-12-03 15:09:50,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:09:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2065 transitions. [2018-12-03 15:09:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:09:50,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:50,641 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:50,641 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:50,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:50,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1890837259, now seen corresponding path program 1 times [2018-12-03 15:09:50,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:50,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:50,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:50,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:50,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:50,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:50,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:50,742 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 15:09:50,742 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [36], [37], [45], [47], [50], [52] [2018-12-03 15:09:50,743 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:50,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:50,753 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:50,754 INFO L272 AbstractInterpreter]: Visited 12 different actions 30 times. Merged at 10 different actions 12 times. Never widened. Found 9 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 15:09:50,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:50,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:50,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:50,765 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 15:09:50,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:50,773 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:50,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:50,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:50,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:50,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 15:09:50,933 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:50,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:09:50,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:09:50,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:09:50,934 INFO L87 Difference]: Start difference. First operand 1312 states and 2065 transitions. Second operand 15 states. [2018-12-03 15:09:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:53,315 INFO L93 Difference]: Finished difference Result 1779 states and 2806 transitions. [2018-12-03 15:09:53,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:09:53,316 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 15:09:53,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:53,318 INFO L225 Difference]: With dead ends: 1779 [2018-12-03 15:09:53,318 INFO L226 Difference]: Without dead ends: 1777 [2018-12-03 15:09:53,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=487, Invalid=2375, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:09:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2018-12-03 15:09:53,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1453. [2018-12-03 15:09:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1453 states. [2018-12-03 15:09:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2301 transitions. [2018-12-03 15:09:53,933 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2301 transitions. Word has length 18 [2018-12-03 15:09:53,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:53,934 INFO L480 AbstractCegarLoop]: Abstraction has 1453 states and 2301 transitions. [2018-12-03 15:09:53,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:09:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2301 transitions. [2018-12-03 15:09:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:09:53,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:53,935 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:53,935 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:53,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:53,935 INFO L82 PathProgramCache]: Analyzing trace with hash 740718717, now seen corresponding path program 2 times [2018-12-03 15:09:53,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:53,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:53,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:53,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:53,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:54,032 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:54,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:54,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:54,033 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:09:54,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:09:54,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:54,033 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 15:09:54,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:09:54,043 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:09:54,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:09:54,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:09:54,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:54,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:09:54,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:54,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 15:09:54,279 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:54,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:09:54,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:09:54,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:09:54,280 INFO L87 Difference]: Start difference. First operand 1453 states and 2301 transitions. Second operand 16 states. [2018-12-03 15:09:57,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:57,660 INFO L93 Difference]: Finished difference Result 1849 states and 2916 transitions. [2018-12-03 15:09:57,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:09:57,661 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 15:09:57,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:57,663 INFO L225 Difference]: With dead ends: 1849 [2018-12-03 15:09:57,663 INFO L226 Difference]: Without dead ends: 1847 [2018-12-03 15:09:57,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1576 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1317, Invalid=4845, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 15:09:57,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2018-12-03 15:09:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1505. [2018-12-03 15:09:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2018-12-03 15:09:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2384 transitions. [2018-12-03 15:09:58,254 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2384 transitions. Word has length 18 [2018-12-03 15:09:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:58,255 INFO L480 AbstractCegarLoop]: Abstraction has 1505 states and 2384 transitions. [2018-12-03 15:09:58,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:09:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2384 transitions. [2018-12-03 15:09:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:09:58,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:58,256 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:09:58,256 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:58,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:58,257 INFO L82 PathProgramCache]: Analyzing trace with hash 749306886, now seen corresponding path program 1 times [2018-12-03 15:09:58,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:58,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:58,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:09:58,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:58,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:58,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:58,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:58,379 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 15:09:58,380 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [37], [38], [41], [43], [45], [47], [50] [2018-12-03 15:09:58,380 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:58,381 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:58,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:58,390 INFO L272 AbstractInterpreter]: Visited 11 different actions 25 times. Merged at 8 different actions 10 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:09:58,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:58,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:58,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:58,428 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:58,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:58,445 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:58,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:58,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:58,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:58,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2018-12-03 15:09:58,813 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:58,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:09:58,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:09:58,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:09:58,814 INFO L87 Difference]: Start difference. First operand 1505 states and 2384 transitions. Second operand 19 states. [2018-12-03 15:10:05,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:05,837 INFO L93 Difference]: Finished difference Result 4923 states and 7834 transitions. [2018-12-03 15:10:05,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-12-03 15:10:05,837 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 15:10:05,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:05,842 INFO L225 Difference]: With dead ends: 4923 [2018-12-03 15:10:05,842 INFO L226 Difference]: Without dead ends: 3654 [2018-12-03 15:10:05,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11798 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3851, Invalid=25219, Unknown=0, NotChecked=0, Total=29070 [2018-12-03 15:10:05,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2018-12-03 15:10:06,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 2695. [2018-12-03 15:10:06,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2018-12-03 15:10:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 4311 transitions. [2018-12-03 15:10:06,863 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 4311 transitions. Word has length 18 [2018-12-03 15:10:06,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:06,863 INFO L480 AbstractCegarLoop]: Abstraction has 2695 states and 4311 transitions. [2018-12-03 15:10:06,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:10:06,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 4311 transitions. [2018-12-03 15:10:06,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:10:06,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:06,865 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:06,865 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:06,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:06,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1434281659, now seen corresponding path program 1 times [2018-12-03 15:10:06,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:06,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:06,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:06,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:06,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:06,965 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:06,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:06,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:06,966 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 15:10:06,966 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [36], [38], [41], [43], [45], [46] [2018-12-03 15:10:06,966 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:10:06,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:10:06,976 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:10:06,976 INFO L272 AbstractInterpreter]: Visited 12 different actions 30 times. Merged at 10 different actions 12 times. Never widened. Found 9 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 15:10:06,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:06,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:10:06,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:06,983 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:06,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:06,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:10:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:06,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:07,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:07,216 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:07,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:07,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2018-12-03 15:10:07,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:07,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:10:07,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:10:07,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:10:07,236 INFO L87 Difference]: Start difference. First operand 2695 states and 4311 transitions. Second operand 16 states. [2018-12-03 15:10:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:11,220 INFO L93 Difference]: Finished difference Result 4103 states and 6582 transitions. [2018-12-03 15:10:11,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:10:11,220 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 15:10:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:11,224 INFO L225 Difference]: With dead ends: 4103 [2018-12-03 15:10:11,224 INFO L226 Difference]: Without dead ends: 4052 [2018-12-03 15:10:11,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1002, Invalid=3420, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:10:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2018-12-03 15:10:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 2890. [2018-12-03 15:10:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2018-12-03 15:10:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 4653 transitions. [2018-12-03 15:10:12,284 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 4653 transitions. Word has length 18 [2018-12-03 15:10:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:12,284 INFO L480 AbstractCegarLoop]: Abstraction has 2890 states and 4653 transitions. [2018-12-03 15:10:12,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:10:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 4653 transitions. [2018-12-03 15:10:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:10:12,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:12,286 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:12,286 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:12,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1483012849, now seen corresponding path program 1 times [2018-12-03 15:10:12,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:12,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:12,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:12,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:12,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:12,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:12,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:12,561 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 15:10:12,562 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [23], [25], [27], [30], [32], [36], [38], [41], [43] [2018-12-03 15:10:12,562 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:10:12,562 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:10:12,580 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:10:12,580 INFO L272 AbstractInterpreter]: Visited 14 different actions 36 times. Merged at 12 different actions 16 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 15:10:12,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:12,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:10:12,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:12,585 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:12,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:12,594 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:10:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:12,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:13,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:13,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:13,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2018-12-03 15:10:13,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:13,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:10:13,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:10:13,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:10:13,510 INFO L87 Difference]: Start difference. First operand 2890 states and 4653 transitions. Second operand 18 states. [2018-12-03 15:10:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:18,103 INFO L93 Difference]: Finished difference Result 4467 states and 7172 transitions. [2018-12-03 15:10:18,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:10:18,103 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 15:10:18,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:18,108 INFO L225 Difference]: With dead ends: 4467 [2018-12-03 15:10:18,108 INFO L226 Difference]: Without dead ends: 4465 [2018-12-03 15:10:18,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1116, Invalid=4736, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:10:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4465 states. [2018-12-03 15:10:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4465 to 3583. [2018-12-03 15:10:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3583 states. [2018-12-03 15:10:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 5784 transitions. [2018-12-03 15:10:19,597 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 5784 transitions. Word has length 18 [2018-12-03 15:10:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:19,597 INFO L480 AbstractCegarLoop]: Abstraction has 3583 states and 5784 transitions. [2018-12-03 15:10:19,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:10:19,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 5784 transitions. [2018-12-03 15:10:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:10:19,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:19,599 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:19,600 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:19,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:19,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1851213523, now seen corresponding path program 3 times [2018-12-03 15:10:19,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:19,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:19,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:19,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:19,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:19,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:19,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:19,696 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:10:19,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:10:19,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:19,697 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:19,704 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:10:19,704 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:10:19,710 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:10:19,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:10:19,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:10:19,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:10:19,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:19,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 15:10:19,899 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:19,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:10:19,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:10:19,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:10:19,900 INFO L87 Difference]: Start difference. First operand 3583 states and 5784 transitions. Second operand 15 states. [2018-12-03 15:10:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:25,354 INFO L93 Difference]: Finished difference Result 5480 states and 8882 transitions. [2018-12-03 15:10:25,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 15:10:25,354 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 15:10:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:25,358 INFO L225 Difference]: With dead ends: 5480 [2018-12-03 15:10:25,359 INFO L226 Difference]: Without dead ends: 5475 [2018-12-03 15:10:25,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2423 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1729, Invalid=6461, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 15:10:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2018-12-03 15:10:26,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 3430. [2018-12-03 15:10:26,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3430 states. [2018-12-03 15:10:26,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3430 states to 3430 states and 5514 transitions. [2018-12-03 15:10:26,658 INFO L78 Accepts]: Start accepts. Automaton has 3430 states and 5514 transitions. Word has length 18 [2018-12-03 15:10:26,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:26,659 INFO L480 AbstractCegarLoop]: Abstraction has 3430 states and 5514 transitions. [2018-12-03 15:10:26,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:10:26,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 5514 transitions. [2018-12-03 15:10:26,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:10:26,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:26,661 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:26,661 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:26,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:26,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1899944713, now seen corresponding path program 1 times [2018-12-03 15:10:26,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:26,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:26,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:10:26,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:26,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:26,785 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 15:10:26,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:26,785 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:26,785 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 15:10:26,786 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [23], [25], [27], [32], [36], [38], [41], [43], [45], [47], [50] [2018-12-03 15:10:26,786 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:10:26,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:10:26,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:10:26,800 INFO L272 AbstractInterpreter]: Visited 16 different actions 42 times. Merged at 14 different actions 18 times. Never widened. Found 12 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 15:10:26,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:26,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:10:26,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:26,825 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:26,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:26,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:10:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:26,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:10:26,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:10:27,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:27,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2018-12-03 15:10:27,059 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:27,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:10:27,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:10:27,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:10:27,060 INFO L87 Difference]: Start difference. First operand 3430 states and 5514 transitions. Second operand 17 states. [2018-12-03 15:10:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:33,266 INFO L93 Difference]: Finished difference Result 5007 states and 8126 transitions. [2018-12-03 15:10:33,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 15:10:33,267 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-12-03 15:10:33,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:33,272 INFO L225 Difference]: With dead ends: 5007 [2018-12-03 15:10:33,272 INFO L226 Difference]: Without dead ends: 5005 [2018-12-03 15:10:33,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2909 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1735, Invalid=7967, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 15:10:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5005 states. [2018-12-03 15:10:34,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5005 to 3569. [2018-12-03 15:10:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3569 states. [2018-12-03 15:10:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3569 states to 3569 states and 5750 transitions. [2018-12-03 15:10:34,719 INFO L78 Accepts]: Start accepts. Automaton has 3569 states and 5750 transitions. Word has length 18 [2018-12-03 15:10:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:34,719 INFO L480 AbstractCegarLoop]: Abstraction has 3569 states and 5750 transitions. [2018-12-03 15:10:34,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:10:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3569 states and 5750 transitions. [2018-12-03 15:10:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:10:34,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:34,720 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:34,721 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:34,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:34,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1199474987, now seen corresponding path program 2 times [2018-12-03 15:10:34,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:34,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:34,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:34,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:34,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:34,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:34,812 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:34,812 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:10:34,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:10:34,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:34,812 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:34,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:10:34,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:10:34,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:10:34,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:10:34,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:34,935 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:10:34,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:10:35,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:35,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 15:10:35,024 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:35,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:10:35,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:10:35,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:10:35,024 INFO L87 Difference]: Start difference. First operand 3569 states and 5750 transitions. Second operand 15 states. [2018-12-03 15:10:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:39,476 INFO L93 Difference]: Finished difference Result 4931 states and 7956 transitions. [2018-12-03 15:10:39,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:10:39,476 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 15:10:39,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:39,481 INFO L225 Difference]: With dead ends: 4931 [2018-12-03 15:10:39,481 INFO L226 Difference]: Without dead ends: 4929 [2018-12-03 15:10:39,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=887, Invalid=4083, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:10:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4929 states. [2018-12-03 15:10:40,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4929 to 3555. [2018-12-03 15:10:40,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3555 states. [2018-12-03 15:10:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3555 states and 5693 transitions. [2018-12-03 15:10:40,909 INFO L78 Accepts]: Start accepts. Automaton has 3555 states and 5693 transitions. Word has length 18 [2018-12-03 15:10:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:40,909 INFO L480 AbstractCegarLoop]: Abstraction has 3555 states and 5693 transitions. [2018-12-03 15:10:40,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:10:40,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3555 states and 5693 transitions. [2018-12-03 15:10:40,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:10:40,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:40,910 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:40,910 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:40,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:40,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1150743797, now seen corresponding path program 2 times [2018-12-03 15:10:40,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:40,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:40,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:10:40,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:40,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:41,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:41,036 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:41,036 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:10:41,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:10:41,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:41,037 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:41,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:10:41,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:10:41,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:10:41,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:10:41,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:41,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:10:41,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:10:41,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:41,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 15:10:41,236 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:41,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:10:41,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:10:41,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:10:41,237 INFO L87 Difference]: Start difference. First operand 3555 states and 5693 transitions. Second operand 17 states. [2018-12-03 15:10:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:46,285 INFO L93 Difference]: Finished difference Result 4742 states and 7601 transitions. [2018-12-03 15:10:46,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 15:10:46,286 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-12-03 15:10:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:46,290 INFO L225 Difference]: With dead ends: 4742 [2018-12-03 15:10:46,291 INFO L226 Difference]: Without dead ends: 4708 [2018-12-03 15:10:46,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2280 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=991, Invalid=6149, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 15:10:46,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4708 states. [2018-12-03 15:10:47,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4708 to 3514. [2018-12-03 15:10:47,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-12-03 15:10:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 5590 transitions. [2018-12-03 15:10:47,702 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 5590 transitions. Word has length 18 [2018-12-03 15:10:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:47,702 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 5590 transitions. [2018-12-03 15:10:47,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:10:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 5590 transitions. [2018-12-03 15:10:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:10:47,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:47,703 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:47,703 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:47,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:47,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1665373557, now seen corresponding path program 1 times [2018-12-03 15:10:47,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:47,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:47,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:10:47,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:47,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:47,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:47,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:47,863 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 15:10:47,863 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [23], [36], [38], [41], [43], [45], [46], [47], [50], [52] [2018-12-03 15:10:47,864 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:10:47,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:10:47,879 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:10:47,879 INFO L272 AbstractInterpreter]: Visited 13 different actions 29 times. Merged at 9 different actions 11 times. Never widened. Found 9 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 15:10:47,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:47,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:10:47,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:47,917 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:47,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:47,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:10:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:47,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:10:48,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:10:48,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:48,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2018-12-03 15:10:48,357 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:48,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:10:48,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:10:48,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:10:48,358 INFO L87 Difference]: Start difference. First operand 3514 states and 5590 transitions. Second operand 21 states. [2018-12-03 15:10:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:52,730 INFO L93 Difference]: Finished difference Result 3893 states and 6210 transitions. [2018-12-03 15:10:52,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:10:52,730 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2018-12-03 15:10:52,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:52,734 INFO L225 Difference]: With dead ends: 3893 [2018-12-03 15:10:52,734 INFO L226 Difference]: Without dead ends: 3891 [2018-12-03 15:10:52,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=967, Invalid=4003, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:10:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2018-12-03 15:10:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 3702. [2018-12-03 15:10:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3702 states. [2018-12-03 15:10:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 5899 transitions. [2018-12-03 15:10:54,272 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 5899 transitions. Word has length 19 [2018-12-03 15:10:54,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:54,272 INFO L480 AbstractCegarLoop]: Abstraction has 3702 states and 5899 transitions. [2018-12-03 15:10:54,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:10:54,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 5899 transitions. [2018-12-03 15:10:54,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:10:54,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:54,273 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:54,273 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:54,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:54,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1271169050, now seen corresponding path program 1 times [2018-12-03 15:10:54,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:54,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:54,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:54,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:54,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:54,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:54,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:54,432 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 15:10:54,432 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [32], [36], [37], [38], [41], [43] [2018-12-03 15:10:54,433 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:10:54,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:10:54,441 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:10:54,442 INFO L272 AbstractInterpreter]: Visited 12 different actions 30 times. Merged at 10 different actions 13 times. Never widened. Found 9 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 15:10:54,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:54,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:10:54,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:54,449 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:54,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:54,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:10:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:54,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:54,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:54,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:54,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 27 [2018-12-03 15:10:54,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:54,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:10:54,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:10:54,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:10:54,736 INFO L87 Difference]: Start difference. First operand 3702 states and 5899 transitions. Second operand 19 states. [2018-12-03 15:10:55,590 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 15:10:56,374 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-12-03 15:10:56,832 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2018-12-03 15:11:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:02,837 INFO L93 Difference]: Finished difference Result 6554 states and 10571 transitions. [2018-12-03 15:11:02,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:11:02,838 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 15:11:02,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:02,844 INFO L225 Difference]: With dead ends: 6554 [2018-12-03 15:11:02,844 INFO L226 Difference]: Without dead ends: 6543 [2018-12-03 15:11:02,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1381, Invalid=4625, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:11:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6543 states. [2018-12-03 15:11:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6543 to 4454. [2018-12-03 15:11:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2018-12-03 15:11:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 7183 transitions. [2018-12-03 15:11:05,015 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 7183 transitions. Word has length 19 [2018-12-03 15:11:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:05,016 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 7183 transitions. [2018-12-03 15:11:05,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:11:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 7183 transitions. [2018-12-03 15:11:05,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:11:05,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:05,017 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:11:05,017 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:05,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:05,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1231183154, now seen corresponding path program 1 times [2018-12-03 15:11:05,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:05,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:05,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:05,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:05,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:05,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:05,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:05,145 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 15:11:05,145 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [32], [36], [37], [38], [41], [43], [45], [47], [50] [2018-12-03 15:11:05,146 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:11:05,146 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:11:05,158 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:11:05,158 INFO L272 AbstractInterpreter]: Visited 14 different actions 36 times. Merged at 12 different actions 15 times. Never widened. Found 11 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 15:11:05,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:05,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:11:05,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:05,193 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:05,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:05,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:11:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:05,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:11:05,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:11:05,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:05,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2018-12-03 15:11:05,474 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:05,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:11:05,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:11:05,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:11:05,474 INFO L87 Difference]: Start difference. First operand 4454 states and 7183 transitions. Second operand 18 states. [2018-12-03 15:11:15,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:15,356 INFO L93 Difference]: Finished difference Result 8116 states and 13179 transitions. [2018-12-03 15:11:15,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:11:15,356 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2018-12-03 15:11:15,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:15,363 INFO L225 Difference]: With dead ends: 8116 [2018-12-03 15:11:15,364 INFO L226 Difference]: Without dead ends: 8099 [2018-12-03 15:11:15,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2106 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1490, Invalid=6342, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 15:11:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8099 states. [2018-12-03 15:11:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8099 to 4656. [2018-12-03 15:11:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4656 states. [2018-12-03 15:11:17,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4656 states to 4656 states and 7487 transitions. [2018-12-03 15:11:17,720 INFO L78 Accepts]: Start accepts. Automaton has 4656 states and 7487 transitions. Word has length 19 [2018-12-03 15:11:17,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:17,720 INFO L480 AbstractCegarLoop]: Abstraction has 4656 states and 7487 transitions. [2018-12-03 15:11:17,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:11:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand 4656 states and 7487 transitions. [2018-12-03 15:11:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:11:17,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:17,722 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 15:11:17,722 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:17,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:17,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1608911408, now seen corresponding path program 3 times [2018-12-03 15:11:17,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:17,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:17,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:17,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:17,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:11:17,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:17,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:17,845 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:11:17,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:11:17,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:17,845 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:17,854 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:11:17,854 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:11:17,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:11:17,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:11:17,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:11:18,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:11:18,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:18,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2018-12-03 15:11:18,363 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:18,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:11:18,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:11:18,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:11:18,363 INFO L87 Difference]: Start difference. First operand 4656 states and 7487 transitions. Second operand 19 states. [2018-12-03 15:11:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:27,210 INFO L93 Difference]: Finished difference Result 9416 states and 15153 transitions. [2018-12-03 15:11:27,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 15:11:27,210 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-12-03 15:11:27,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:27,215 INFO L225 Difference]: With dead ends: 9416 [2018-12-03 15:11:27,215 INFO L226 Difference]: Without dead ends: 5079 [2018-12-03 15:11:27,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4269 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2456, Invalid=11824, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:11:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5079 states. [2018-12-03 15:11:29,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5079 to 4622. [2018-12-03 15:11:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4622 states. [2018-12-03 15:11:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4622 states to 4622 states and 7414 transitions. [2018-12-03 15:11:29,620 INFO L78 Accepts]: Start accepts. Automaton has 4622 states and 7414 transitions. Word has length 21 [2018-12-03 15:11:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:29,621 INFO L480 AbstractCegarLoop]: Abstraction has 4622 states and 7414 transitions. [2018-12-03 15:11:29,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:11:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4622 states and 7414 transitions. [2018-12-03 15:11:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:11:29,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:29,622 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:11:29,623 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:29,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:29,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1688920231, now seen corresponding path program 1 times [2018-12-03 15:11:29,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:29,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:29,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:11:29,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:29,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:29,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:29,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:29,733 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 15:11:29,733 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [12], [15], [23], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 15:11:29,734 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:11:29,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:11:29,742 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:11:29,743 INFO L272 AbstractInterpreter]: Visited 15 different actions 30 times. Merged at 8 different actions 10 times. Never widened. Found 9 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 15:11:29,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:29,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:11:29,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:29,779 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:29,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:29,796 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:11:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:29,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:29,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:30,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:30,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2018-12-03 15:11:30,253 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:30,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:11:30,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:11:30,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:11:30,253 INFO L87 Difference]: Start difference. First operand 4622 states and 7414 transitions. Second operand 17 states. [2018-12-03 15:11:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:38,050 INFO L93 Difference]: Finished difference Result 6773 states and 10838 transitions. [2018-12-03 15:11:38,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 15:11:38,051 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-12-03 15:11:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:38,057 INFO L225 Difference]: With dead ends: 6773 [2018-12-03 15:11:38,058 INFO L226 Difference]: Without dead ends: 6771 [2018-12-03 15:11:38,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2358 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1779, Invalid=6411, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 15:11:38,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6771 states. [2018-12-03 15:11:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6771 to 4410. [2018-12-03 15:11:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4410 states. [2018-12-03 15:11:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 4410 states and 7017 transitions. [2018-12-03 15:11:40,366 INFO L78 Accepts]: Start accepts. Automaton has 4410 states and 7017 transitions. Word has length 21 [2018-12-03 15:11:40,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:40,367 INFO L480 AbstractCegarLoop]: Abstraction has 4410 states and 7017 transitions. [2018-12-03 15:11:40,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:11:40,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4410 states and 7017 transitions. [2018-12-03 15:11:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:11:40,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:40,368 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:11:40,369 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:40,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash 534864297, now seen corresponding path program 1 times [2018-12-03 15:11:40,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:40,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:40,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:40,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:40,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:40,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:40,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:40,581 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 15:11:40,581 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [12], [15], [23], [25], [27], [30], [36], [38], [41], [43], [45], [47], [52] [2018-12-03 15:11:40,582 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:11:40,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:11:40,605 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:11:40,605 INFO L272 AbstractInterpreter]: Visited 17 different actions 37 times. Merged at 11 different actions 13 times. Never widened. Found 11 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 15:11:40,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:40,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:11:40,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:40,650 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:40,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:40,665 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:11:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:40,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:41,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:41,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:41,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2018-12-03 15:11:41,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:41,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:11:41,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:11:41,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:11:41,564 INFO L87 Difference]: Start difference. First operand 4410 states and 7017 transitions. Second operand 16 states. [2018-12-03 15:11:48,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:48,987 INFO L93 Difference]: Finished difference Result 6829 states and 10911 transitions. [2018-12-03 15:11:48,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:11:48,987 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-12-03 15:11:48,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:48,993 INFO L225 Difference]: With dead ends: 6829 [2018-12-03 15:11:48,993 INFO L226 Difference]: Without dead ends: 6827 [2018-12-03 15:11:48,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=843, Invalid=3189, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:11:48,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6827 states. [2018-12-03 15:11:51,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6827 to 4132. [2018-12-03 15:11:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4132 states. [2018-12-03 15:11:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 6566 transitions. [2018-12-03 15:11:51,242 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 6566 transitions. Word has length 21 [2018-12-03 15:11:51,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:51,243 INFO L480 AbstractCegarLoop]: Abstraction has 4132 states and 6566 transitions. [2018-12-03 15:11:51,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:11:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 6566 transitions. [2018-12-03 15:11:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:11:51,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:51,245 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 15:11:51,245 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:51,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:51,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1298110833, now seen corresponding path program 4 times [2018-12-03 15:11:51,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:51,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:51,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:51,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:51,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:51,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:51,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:51,393 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:11:51,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:11:51,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:51,393 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:51,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:51,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:11:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:51,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:11:51,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:11:52,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:52,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2018-12-03 15:11:52,035 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:52,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:11:52,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:11:52,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:11:52,036 INFO L87 Difference]: Start difference. First operand 4132 states and 6566 transitions. Second operand 19 states. [2018-12-03 15:12:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:00,468 INFO L93 Difference]: Finished difference Result 9377 states and 14799 transitions. [2018-12-03 15:12:00,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 15:12:00,468 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-12-03 15:12:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:00,474 INFO L225 Difference]: With dead ends: 9377 [2018-12-03 15:12:00,474 INFO L226 Difference]: Without dead ends: 5463 [2018-12-03 15:12:00,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4905 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1834, Invalid=12446, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:12:00,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2018-12-03 15:12:03,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 4506. [2018-12-03 15:12:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4506 states. [2018-12-03 15:12:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 7148 transitions. [2018-12-03 15:12:03,027 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 7148 transitions. Word has length 21 [2018-12-03 15:12:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:03,028 INFO L480 AbstractCegarLoop]: Abstraction has 4506 states and 7148 transitions. [2018-12-03 15:12:03,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:12:03,028 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 7148 transitions. [2018-12-03 15:12:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:12:03,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:03,029 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 15:12:03,030 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:03,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:03,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2122062335, now seen corresponding path program 5 times [2018-12-03 15:12:03,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:03,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:03,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:03,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:03,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:12:03,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:03,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:03,261 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:12:03,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:12:03,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:03,262 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:03,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:12:03,272 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:12:03,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:12:03,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:12:03,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:03,350 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 15:12:03,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 15:12:03,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:03,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2018-12-03 15:12:03,466 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:03,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:12:03,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:12:03,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:12:03,467 INFO L87 Difference]: Start difference. First operand 4506 states and 7148 transitions. Second operand 18 states. [2018-12-03 15:12:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:15,023 INFO L93 Difference]: Finished difference Result 6513 states and 10374 transitions. [2018-12-03 15:12:15,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 15:12:15,023 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 15:12:15,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:15,029 INFO L225 Difference]: With dead ends: 6513 [2018-12-03 15:12:15,029 INFO L226 Difference]: Without dead ends: 6505 [2018-12-03 15:12:15,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4627 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3445, Invalid=11807, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:12:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6505 states. [2018-12-03 15:12:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6505 to 3159. [2018-12-03 15:12:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3159 states. [2018-12-03 15:12:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 4960 transitions. [2018-12-03 15:12:16,968 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 4960 transitions. Word has length 21 [2018-12-03 15:12:16,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:16,968 INFO L480 AbstractCegarLoop]: Abstraction has 3159 states and 4960 transitions. [2018-12-03 15:12:16,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:12:16,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 4960 transitions. [2018-12-03 15:12:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:12:16,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:16,970 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 15:12:16,970 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:16,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:16,970 INFO L82 PathProgramCache]: Analyzing trace with hash 274158317, now seen corresponding path program 2 times [2018-12-03 15:12:16,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:16,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:16,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:12:16,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:16,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:12:17,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:17,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:17,090 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:12:17,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:12:17,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:17,091 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:17,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:12:17,101 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:12:17,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:12:17,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:12:17,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 15:12:17,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 15:12:17,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:17,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2018-12-03 15:12:17,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:17,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:12:17,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:12:17,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:12:17,430 INFO L87 Difference]: Start difference. First operand 3159 states and 4960 transitions. Second operand 21 states. [2018-12-03 15:12:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:37,123 INFO L93 Difference]: Finished difference Result 8041 states and 12780 transitions. [2018-12-03 15:12:37,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-12-03 15:12:37,123 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 15:12:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:37,130 INFO L225 Difference]: With dead ends: 8041 [2018-12-03 15:12:37,130 INFO L226 Difference]: Without dead ends: 8030 [2018-12-03 15:12:37,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17937 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5328, Invalid=41544, Unknown=0, NotChecked=0, Total=46872 [2018-12-03 15:12:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8030 states. [2018-12-03 15:12:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8030 to 3767. [2018-12-03 15:12:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3767 states. [2018-12-03 15:12:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 5901 transitions. [2018-12-03 15:12:39,667 INFO L78 Accepts]: Start accepts. Automaton has 3767 states and 5901 transitions. Word has length 21 [2018-12-03 15:12:39,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:39,667 INFO L480 AbstractCegarLoop]: Abstraction has 3767 states and 5901 transitions. [2018-12-03 15:12:39,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:12:39,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3767 states and 5901 transitions. [2018-12-03 15:12:39,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:12:39,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:39,669 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:39,669 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:39,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:39,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1246813361, now seen corresponding path program 2 times [2018-12-03 15:12:39,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:39,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:39,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:12:39,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:39,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:12:39,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:39,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:39,796 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:12:39,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:12:39,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:39,796 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:39,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:12:39,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:12:39,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:12:39,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:12:39,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:12:40,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:12:40,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:40,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2018-12-03 15:12:40,503 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:40,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:12:40,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:12:40,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=554, Unknown=1, NotChecked=0, Total=650 [2018-12-03 15:12:40,503 INFO L87 Difference]: Start difference. First operand 3767 states and 5901 transitions. Second operand 18 states. [2018-12-03 15:12:46,129 WARN L180 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 15:12:49,585 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-03 15:12:52,067 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-03 15:12:54,479 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 15:12:57,778 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-03 15:12:59,620 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-03 15:13:00,703 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-03 15:13:01,131 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-03 15:13:05,178 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-12-03 15:13:05,477 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 15:13:05,783 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-03 15:13:07,380 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-03 15:13:12,359 WARN L180 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 15:13:12,983 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 15:13:14,007 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 15:13:15,807 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-03 15:13:16,307 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-03 15:13:18,985 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-03 15:13:19,272 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-12-03 15:13:20,223 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-03 15:13:20,918 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-03 15:13:21,219 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-03 15:13:22,525 WARN L180 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 15:13:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:13:27,673 INFO L93 Difference]: Finished difference Result 8236 states and 13011 transitions. [2018-12-03 15:13:27,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-12-03 15:13:27,673 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 15:13:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:13:27,682 INFO L225 Difference]: With dead ends: 8236 [2018-12-03 15:13:27,683 INFO L226 Difference]: Without dead ends: 8225 [2018-12-03 15:13:27,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11731 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=5455, Invalid=26039, Unknown=12, NotChecked=0, Total=31506 [2018-12-03 15:13:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8225 states. [2018-12-03 15:13:30,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8225 to 3526. [2018-12-03 15:13:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3526 states. [2018-12-03 15:13:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5543 transitions. [2018-12-03 15:13:30,312 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5543 transitions. Word has length 21 [2018-12-03 15:13:30,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:13:30,312 INFO L480 AbstractCegarLoop]: Abstraction has 3526 states and 5543 transitions. [2018-12-03 15:13:30,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:13:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5543 transitions. [2018-12-03 15:13:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:13:30,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:13:30,314 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:13:30,314 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:13:30,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:13:30,315 INFO L82 PathProgramCache]: Analyzing trace with hash -471522047, now seen corresponding path program 2 times [2018-12-03 15:13:30,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:13:30,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:30,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:13:30,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:30,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:13:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:13:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:30,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:30,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:13:30,439 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:13:30,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:13:30,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:30,440 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:13:30,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:13:30,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:13:30,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:13:30,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:13:30,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:13:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:13:30,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:13:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:13:30,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:13:30,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2018-12-03 15:13:30,729 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:13:30,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:13:30,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:13:30,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:13:30,730 INFO L87 Difference]: Start difference. First operand 3526 states and 5543 transitions. Second operand 20 states. [2018-12-03 15:13:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:13:47,064 INFO L93 Difference]: Finished difference Result 7411 states and 11736 transitions. [2018-12-03 15:13:47,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-12-03 15:13:47,064 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-12-03 15:13:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:13:47,070 INFO L225 Difference]: With dead ends: 7411 [2018-12-03 15:13:47,070 INFO L226 Difference]: Without dead ends: 7409 [2018-12-03 15:13:47,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3224, Invalid=18238, Unknown=0, NotChecked=0, Total=21462 [2018-12-03 15:13:47,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7409 states. [2018-12-03 15:13:49,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7409 to 3433. [2018-12-03 15:13:49,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3433 states. [2018-12-03 15:13:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 5394 transitions. [2018-12-03 15:13:49,617 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 5394 transitions. Word has length 24 [2018-12-03 15:13:49,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:13:49,617 INFO L480 AbstractCegarLoop]: Abstraction has 3433 states and 5394 transitions. [2018-12-03 15:13:49,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:13:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 5394 transitions. [2018-12-03 15:13:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:13:49,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:13:49,619 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2018-12-03 15:13:49,620 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:13:49,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:13:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1997760783, now seen corresponding path program 3 times [2018-12-03 15:13:49,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:13:49,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:49,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:13:49,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:49,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:13:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:13:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:13:49,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:49,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:13:49,858 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:13:49,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:13:49,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:49,858 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:13:49,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:13:49,868 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:13:49,877 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:13:49,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:13:49,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:13:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:13:50,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:13:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:13:50,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:13:50,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 28 [2018-12-03 15:13:50,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:13:50,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:13:50,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:13:50,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:13:50,173 INFO L87 Difference]: Start difference. First operand 3433 states and 5394 transitions. Second operand 24 states. [2018-12-03 15:13:58,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:13:58,288 INFO L93 Difference]: Finished difference Result 7328 states and 11502 transitions. [2018-12-03 15:13:58,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 15:13:58,288 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2018-12-03 15:13:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:13:58,292 INFO L225 Difference]: With dead ends: 7328 [2018-12-03 15:13:58,293 INFO L226 Difference]: Without dead ends: 4152 [2018-12-03 15:13:58,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4696 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2065, Invalid=11507, Unknown=0, NotChecked=0, Total=13572 [2018-12-03 15:13:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2018-12-03 15:14:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 3677. [2018-12-03 15:14:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3677 states. [2018-12-03 15:14:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 5781 transitions. [2018-12-03 15:14:00,976 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 5781 transitions. Word has length 25 [2018-12-03 15:14:00,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:14:00,976 INFO L480 AbstractCegarLoop]: Abstraction has 3677 states and 5781 transitions. [2018-12-03 15:14:00,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:14:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 5781 transitions. [2018-12-03 15:14:00,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:14:00,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:14:00,978 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:14:00,978 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:14:00,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:00,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1735749504, now seen corresponding path program 1 times [2018-12-03 15:14:00,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:14:00,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:00,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:14:00,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:00,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:14:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:01,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:01,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:14:01,561 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-03 15:14:01,562 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [25], [26], [27], [30], [32], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 15:14:01,562 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:14:01,562 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:14:01,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:14:01,575 INFO L272 AbstractInterpreter]: Visited 17 different actions 42 times. Merged at 13 different actions 17 times. Never widened. Found 14 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 15:14:01,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:01,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:14:01,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:01,614 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:14:01,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:01,635 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:14:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:01,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:14:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:14:03,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:14:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:14:03,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:14:03,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2018-12-03 15:14:03,933 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:14:03,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:14:03,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:14:03,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:14:03,934 INFO L87 Difference]: Start difference. First operand 3677 states and 5781 transitions. Second operand 24 states. [2018-12-03 15:14:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:14:18,476 INFO L93 Difference]: Finished difference Result 5347 states and 8486 transitions. [2018-12-03 15:14:18,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-12-03 15:14:18,476 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2018-12-03 15:14:18,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:14:18,481 INFO L225 Difference]: With dead ends: 5347 [2018-12-03 15:14:18,481 INFO L226 Difference]: Without dead ends: 5345 [2018-12-03 15:14:18,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9545 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=4946, Invalid=23110, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 15:14:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5345 states. [2018-12-03 15:14:21,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5345 to 4112. [2018-12-03 15:14:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4112 states. [2018-12-03 15:14:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4112 states to 4112 states and 6480 transitions. [2018-12-03 15:14:21,566 INFO L78 Accepts]: Start accepts. Automaton has 4112 states and 6480 transitions. Word has length 25 [2018-12-03 15:14:21,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:14:21,567 INFO L480 AbstractCegarLoop]: Abstraction has 4112 states and 6480 transitions. [2018-12-03 15:14:21,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:14:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4112 states and 6480 transitions. [2018-12-03 15:14:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:14:21,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:14:21,569 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:14:21,569 INFO L423 AbstractCegarLoop]: === Iteration 72 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:14:21,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:21,570 INFO L82 PathProgramCache]: Analyzing trace with hash -868093692, now seen corresponding path program 4 times [2018-12-03 15:14:21,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:14:21,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:21,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:21,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:21,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:14:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:21,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:21,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:14:21,755 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:14:21,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:14:21,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:21,756 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:14:21,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:21,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:14:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:21,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:14:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:14:21,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:14:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:14:22,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:14:22,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 29 [2018-12-03 15:14:22,041 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:14:22,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:14:22,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:14:22,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:14:22,042 INFO L87 Difference]: Start difference. First operand 4112 states and 6480 transitions. Second operand 21 states. [2018-12-03 15:14:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:14:34,948 INFO L93 Difference]: Finished difference Result 6190 states and 9786 transitions. [2018-12-03 15:14:34,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-12-03 15:14:34,949 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2018-12-03 15:14:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:14:34,954 INFO L225 Difference]: With dead ends: 6190 [2018-12-03 15:14:34,954 INFO L226 Difference]: Without dead ends: 6188 [2018-12-03 15:14:34,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7876 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4385, Invalid=18265, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 15:14:34,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6188 states. [2018-12-03 15:14:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6188 to 4324. [2018-12-03 15:14:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4324 states. [2018-12-03 15:14:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4324 states to 4324 states and 6824 transitions. [2018-12-03 15:14:38,096 INFO L78 Accepts]: Start accepts. Automaton has 4324 states and 6824 transitions. Word has length 25 [2018-12-03 15:14:38,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:14:38,097 INFO L480 AbstractCegarLoop]: Abstraction has 4324 states and 6824 transitions. [2018-12-03 15:14:38,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:14:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4324 states and 6824 transitions. [2018-12-03 15:14:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:14:38,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:14:38,100 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:14:38,100 INFO L423 AbstractCegarLoop]: === Iteration 73 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:14:38,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1568806716, now seen corresponding path program 1 times [2018-12-03 15:14:38,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:14:38,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:38,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:38,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:38,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:14:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:39,511 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-12-03 15:14:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:39,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:39,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:14:39,597 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-03 15:14:39,597 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [12], [15], [17], [23], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 15:14:39,597 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:14:39,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:14:39,610 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:14:39,610 INFO L272 AbstractInterpreter]: Visited 17 different actions 42 times. Merged at 14 different actions 17 times. Never widened. Found 14 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 15:14:39,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:39,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:14:39,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:39,648 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:14:39,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:39,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:14:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:39,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:14:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:14:40,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:14:40,254 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:14:40,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:14:40,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2018-12-03 15:14:40,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:14:40,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:14:40,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:14:40,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:14:40,276 INFO L87 Difference]: Start difference. First operand 4324 states and 6824 transitions. Second operand 24 states. [2018-12-03 15:14:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:14:59,007 INFO L93 Difference]: Finished difference Result 7157 states and 11372 transitions. [2018-12-03 15:14:59,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-12-03 15:14:59,008 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2018-12-03 15:14:59,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:14:59,014 INFO L225 Difference]: With dead ends: 7157 [2018-12-03 15:14:59,014 INFO L226 Difference]: Without dead ends: 7155 [2018-12-03 15:14:59,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7965 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=4587, Invalid=19593, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 15:14:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7155 states. [2018-12-03 15:15:03,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7155 to 4870. [2018-12-03 15:15:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4870 states. [2018-12-03 15:15:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 7673 transitions. [2018-12-03 15:15:03,039 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 7673 transitions. Word has length 25 [2018-12-03 15:15:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:15:03,039 INFO L480 AbstractCegarLoop]: Abstraction has 4870 states and 7673 transitions. [2018-12-03 15:15:03,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:15:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 7673 transitions. [2018-12-03 15:15:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:15:03,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:15:03,042 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:15:03,042 INFO L423 AbstractCegarLoop]: === Iteration 74 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:15:03,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:03,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2018393209, now seen corresponding path program 1 times [2018-12-03 15:15:03,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:15:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:03,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:03,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:15:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:03,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:03,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:15:03,396 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-03 15:15:03,397 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [36], [37], [38], [41], [43], [45], [47], [50] [2018-12-03 15:15:03,397 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:15:03,397 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:15:03,406 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:15:03,407 INFO L272 AbstractInterpreter]: Visited 14 different actions 34 times. Merged at 11 different actions 13 times. Never widened. Found 11 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 15:15:03,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:03,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:15:03,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:03,450 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:15:03,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:03,467 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:15:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:03,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:15:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:15:03,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:15:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:15:03,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:15:03,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 28 [2018-12-03 15:15:03,808 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:15:03,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:15:03,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:15:03,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:15:03,808 INFO L87 Difference]: Start difference. First operand 4870 states and 7673 transitions. Second operand 23 states. [2018-12-03 15:15:11,543 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-03 15:15:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:15:25,103 INFO L93 Difference]: Finished difference Result 13968 states and 21837 transitions. [2018-12-03 15:15:25,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-12-03 15:15:25,104 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-12-03 15:15:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:15:25,111 INFO L225 Difference]: With dead ends: 13968 [2018-12-03 15:15:25,111 INFO L226 Difference]: Without dead ends: 9235 [2018-12-03 15:15:25,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 16942 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3908, Invalid=39148, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 15:15:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9235 states. [2018-12-03 15:15:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9235 to 6547. [2018-12-03 15:15:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6547 states. [2018-12-03 15:15:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6547 states to 6547 states and 10378 transitions. [2018-12-03 15:15:30,969 INFO L78 Accepts]: Start accepts. Automaton has 6547 states and 10378 transitions. Word has length 25 [2018-12-03 15:15:30,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:15:30,969 INFO L480 AbstractCegarLoop]: Abstraction has 6547 states and 10378 transitions. [2018-12-03 15:15:30,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:15:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 6547 states and 10378 transitions. [2018-12-03 15:15:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:15:30,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:15:30,972 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:15:30,972 INFO L423 AbstractCegarLoop]: === Iteration 75 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:15:30,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:30,972 INFO L82 PathProgramCache]: Analyzing trace with hash 998547776, now seen corresponding path program 2 times [2018-12-03 15:15:30,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:15:30,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:30,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:30,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:30,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:15:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:31,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:31,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:15:31,135 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:15:31,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:15:31,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:31,135 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:15:31,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:15:31,144 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:15:31,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 15:15:31,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:15:31,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:15:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:15:31,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:15:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:15:31,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:15:31,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 32 [2018-12-03 15:15:31,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:15:31,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:15:31,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:15:31,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:15:31,515 INFO L87 Difference]: Start difference. First operand 6547 states and 10378 transitions. Second operand 25 states. [2018-12-03 15:15:53,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:15:53,455 INFO L93 Difference]: Finished difference Result 10436 states and 16883 transitions. [2018-12-03 15:15:53,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-12-03 15:15:53,455 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2018-12-03 15:15:53,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:15:53,463 INFO L225 Difference]: With dead ends: 10436 [2018-12-03 15:15:53,463 INFO L226 Difference]: Without dead ends: 10434 [2018-12-03 15:15:53,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11212 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=6462, Invalid=27210, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 15:15:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10434 states. [2018-12-03 15:16:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10434 to 7390. [2018-12-03 15:16:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2018-12-03 15:16:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 11793 transitions. [2018-12-03 15:16:00,109 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 11793 transitions. Word has length 26 [2018-12-03 15:16:00,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:16:00,109 INFO L480 AbstractCegarLoop]: Abstraction has 7390 states and 11793 transitions. [2018-12-03 15:16:00,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:16:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 11793 transitions. [2018-12-03 15:16:00,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:16:00,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:16:00,112 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 15:16:00,113 INFO L423 AbstractCegarLoop]: === Iteration 76 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:16:00,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:00,113 INFO L82 PathProgramCache]: Analyzing trace with hash 604672123, now seen corresponding path program 2 times [2018-12-03 15:16:00,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:16:00,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:00,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:16:00,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:00,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:16:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:16:00,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:00,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:16:00,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:16:00,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:16:00,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:00,340 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:16:00,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:16:00,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:16:00,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:16:00,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:16:00,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:16:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:16:00,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:16:00,615 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:16:00,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:16:00,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 31 [2018-12-03 15:16:00,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:16:00,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:16:00,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:16:00,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:16:00,634 INFO L87 Difference]: Start difference. First operand 7390 states and 11793 transitions. Second operand 23 states. [2018-12-03 15:16:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:16:25,470 INFO L93 Difference]: Finished difference Result 15564 states and 24982 transitions. [2018-12-03 15:16:25,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 15:16:25,470 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2018-12-03 15:16:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:16:25,481 INFO L225 Difference]: With dead ends: 15564 [2018-12-03 15:16:25,482 INFO L226 Difference]: Without dead ends: 15552 [2018-12-03 15:16:25,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2832 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1989, Invalid=7713, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 15:16:25,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15552 states. [2018-12-03 15:16:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15552 to 9180. [2018-12-03 15:16:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9180 states. [2018-12-03 15:16:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9180 states to 9180 states and 14704 transitions. [2018-12-03 15:16:33,928 INFO L78 Accepts]: Start accepts. Automaton has 9180 states and 14704 transitions. Word has length 26 [2018-12-03 15:16:33,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:16:33,928 INFO L480 AbstractCegarLoop]: Abstraction has 9180 states and 14704 transitions. [2018-12-03 15:16:33,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:16:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states and 14704 transitions. [2018-12-03 15:16:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:16:33,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:16:33,932 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:16:33,932 INFO L423 AbstractCegarLoop]: === Iteration 77 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:16:33,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:33,932 INFO L82 PathProgramCache]: Analyzing trace with hash -951541235, now seen corresponding path program 1 times [2018-12-03 15:16:33,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:16:33,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:33,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:16:33,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:33,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:16:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:16:34,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:34,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:16:34,152 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 15:16:34,152 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [23], [25], [27], [30], [32], [36], [37], [38], [41], [43] [2018-12-03 15:16:34,153 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:16:34,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:16:34,164 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:16:34,165 INFO L272 AbstractInterpreter]: Visited 14 different actions 36 times. Merged at 11 different actions 15 times. Never widened. Found 12 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 15:16:34,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:34,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:16:34,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:34,202 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:16:34,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:16:34,218 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:16:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:34,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:16:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:16:34,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:16:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:16:34,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:16:34,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 33 [2018-12-03 15:16:34,771 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:16:34,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:16:34,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:16:34,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:16:34,772 INFO L87 Difference]: Start difference. First operand 9180 states and 14704 transitions. Second operand 25 states. [2018-12-03 15:16:59,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:16:59,208 INFO L93 Difference]: Finished difference Result 15778 states and 25294 transitions. [2018-12-03 15:16:59,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 15:16:59,209 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2018-12-03 15:16:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:16:59,223 INFO L225 Difference]: With dead ends: 15778 [2018-12-03 15:16:59,223 INFO L226 Difference]: Without dead ends: 15767 [2018-12-03 15:16:59,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5324 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2454, Invalid=13046, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 15:16:59,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15767 states. [2018-12-03 15:17:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15767 to 11633. [2018-12-03 15:17:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11633 states. [2018-12-03 15:17:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 18699 transitions. [2018-12-03 15:17:09,998 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 18699 transitions. Word has length 26 [2018-12-03 15:17:09,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:17:09,999 INFO L480 AbstractCegarLoop]: Abstraction has 11633 states and 18699 transitions. [2018-12-03 15:17:09,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:17:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 18699 transitions. [2018-12-03 15:17:10,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:17:10,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:17:10,003 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:17:10,003 INFO L423 AbstractCegarLoop]: === Iteration 78 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:17:10,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:17:10,003 INFO L82 PathProgramCache]: Analyzing trace with hash 179058058, now seen corresponding path program 2 times [2018-12-03 15:17:10,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:17:10,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:17:10,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:17:10,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:17:10,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:17:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:17:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:17:10,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:17:10,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:17:10,189 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:17:10,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:17:10,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:17:10,189 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:17:10,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:17:10,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:17:10,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:17:10,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:17:10,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:17:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:17:11,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:17:11,224 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:17:11,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:17:11,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 31 [2018-12-03 15:17:11,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:17:11,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:17:11,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:17:11,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:17:11,244 INFO L87 Difference]: Start difference. First operand 11633 states and 18699 transitions. Second operand 23 states. [2018-12-03 15:17:16,484 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 15:17:23,675 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-03 15:17:24,882 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-12-03 15:17:25,534 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-12-03 15:17:28,241 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-12-03 15:17:28,956 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-12-03 15:17:29,346 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-12-03 15:17:31,257 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-03 15:17:31,636 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-03 15:17:32,805 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-12-03 15:17:33,875 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-12-03 15:17:35,590 WARN L180 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-12-03 15:17:37,747 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-12-03 15:17:39,853 WARN L180 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-12-03 15:17:40,230 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-12-03 15:17:43,340 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-12-03 15:17:44,849 WARN L180 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-12-03 15:17:46,163 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-12-03 15:17:48,481 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-12-03 15:17:52,402 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-12-03 15:17:54,374 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-12-03 15:18:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:18:01,429 INFO L93 Difference]: Finished difference Result 14844 states and 23990 transitions. [2018-12-03 15:18:01,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-12-03 15:18:01,430 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2018-12-03 15:18:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:18:01,443 INFO L225 Difference]: With dead ends: 14844 [2018-12-03 15:18:01,443 INFO L226 Difference]: Without dead ends: 14842 [2018-12-03 15:18:01,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10011 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=4976, Invalid=25121, Unknown=5, NotChecked=0, Total=30102 [2018-12-03 15:18:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14842 states. [2018-12-03 15:18:13,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14842 to 12837. [2018-12-03 15:18:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12837 states. [2018-12-03 15:18:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12837 states to 12837 states and 20694 transitions. [2018-12-03 15:18:13,231 INFO L78 Accepts]: Start accepts. Automaton has 12837 states and 20694 transitions. Word has length 28 [2018-12-03 15:18:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:18:13,231 INFO L480 AbstractCegarLoop]: Abstraction has 12837 states and 20694 transitions. [2018-12-03 15:18:13,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:18:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 12837 states and 20694 transitions. [2018-12-03 15:18:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:18:13,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:18:13,236 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1] [2018-12-03 15:18:13,236 INFO L423 AbstractCegarLoop]: === Iteration 79 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:18:13,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:18:13,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1671739405, now seen corresponding path program 5 times [2018-12-03 15:18:13,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:18:13,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:18:13,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:18:13,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:18:13,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:18:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:18:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:18:13,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:18:13,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:18:13,462 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:18:13,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:18:13,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:18:13,462 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:18:13,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:18:13,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:18:13,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:18:13,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:18:13,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:18:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:18:13,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:18:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:18:14,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:18:14,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 30 [2018-12-03 15:18:14,016 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:18:14,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:18:14,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:18:14,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:18:14,017 INFO L87 Difference]: Start difference. First operand 12837 states and 20694 transitions. Second operand 22 states. [2018-12-03 15:18:18,336 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-03 15:18:23,085 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 15:18:24,353 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-03 15:18:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:18:38,106 INFO L93 Difference]: Finished difference Result 15839 states and 25502 transitions. [2018-12-03 15:18:38,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 15:18:38,107 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-12-03 15:18:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:18:38,121 INFO L225 Difference]: With dead ends: 15839 [2018-12-03 15:18:38,121 INFO L226 Difference]: Without dead ends: 15837 [2018-12-03 15:18:38,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2707 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2653, Invalid=8689, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 15:18:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15837 states. [2018-12-03 15:18:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15837 to 11007. [2018-12-03 15:18:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11007 states. [2018-12-03 15:18:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11007 states to 11007 states and 17619 transitions. [2018-12-03 15:18:48,752 INFO L78 Accepts]: Start accepts. Automaton has 11007 states and 17619 transitions. Word has length 28 [2018-12-03 15:18:48,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:18:48,752 INFO L480 AbstractCegarLoop]: Abstraction has 11007 states and 17619 transitions. [2018-12-03 15:18:48,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:18:48,752 INFO L276 IsEmpty]: Start isEmpty. Operand 11007 states and 17619 transitions. [2018-12-03 15:18:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:18:48,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:18:48,755 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:18:48,755 INFO L423 AbstractCegarLoop]: === Iteration 80 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:18:48,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:18:48,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1100753059, now seen corresponding path program 1 times [2018-12-03 15:18:48,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:18:48,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:18:48,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:18:48,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:18:48,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:18:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:18:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:18:48,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:18:48,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:18:48,962 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 15:18:48,962 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [15], [19], [25], [26], [27], [32], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 15:18:48,962 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:18:48,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:18:48,977 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:18:48,977 INFO L272 AbstractInterpreter]: Visited 19 different actions 49 times. Merged at 16 different actions 20 times. Never widened. Found 16 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 15:18:49,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:18:49,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:18:49,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:18:49,016 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:18:49,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:18:49,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:18:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:18:49,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:18:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:18:49,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:18:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:18:49,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:18:49,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 28 [2018-12-03 15:18:49,485 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:18:49,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:18:49,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:18:49,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:18:49,485 INFO L87 Difference]: Start difference. First operand 11007 states and 17619 transitions. Second operand 23 states. [2018-12-03 15:19:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:19:08,233 INFO L93 Difference]: Finished difference Result 23665 states and 37956 transitions. [2018-12-03 15:19:08,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 15:19:08,233 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2018-12-03 15:19:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:19:08,246 INFO L225 Difference]: With dead ends: 23665 [2018-12-03 15:19:08,246 INFO L226 Difference]: Without dead ends: 12929 [2018-12-03 15:19:08,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4526 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1926, Invalid=12836, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:19:08,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12929 states. [2018-12-03 15:19:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12929 to 10996. [2018-12-03 15:19:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10996 states. [2018-12-03 15:19:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10996 states to 10996 states and 17614 transitions. [2018-12-03 15:19:18,922 INFO L78 Accepts]: Start accepts. Automaton has 10996 states and 17614 transitions. Word has length 28 [2018-12-03 15:19:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:19:18,922 INFO L480 AbstractCegarLoop]: Abstraction has 10996 states and 17614 transitions. [2018-12-03 15:19:18,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:19:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 10996 states and 17614 transitions. [2018-12-03 15:19:18,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:19:18,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:19:18,926 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:19:18,926 INFO L423 AbstractCegarLoop]: === Iteration 81 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:19:18,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:19:18,926 INFO L82 PathProgramCache]: Analyzing trace with hash 564227467, now seen corresponding path program 1 times [2018-12-03 15:19:18,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:19:18,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:19:18,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:19:18,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:19:18,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:19:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:19:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:19:19,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:19:19,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:19:19,093 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 15:19:19,093 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [12], [15], [17], [23], [25], [27], [30], [36], [38], [41], [43], [45], [47], [52] [2018-12-03 15:19:19,094 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:19:19,094 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:19:19,107 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:19:19,107 INFO L272 AbstractInterpreter]: Visited 19 different actions 49 times. Merged at 16 different actions 20 times. Never widened. Found 16 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 15:19:19,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:19:19,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:19:19,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:19:19,123 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:19:19,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:19:19,132 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:19:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:19:19,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:19:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:19:19,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:19:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:19:19,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:19:19,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 29 [2018-12-03 15:19:19,419 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:19:19,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:19:19,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:19:19,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:19:19,419 INFO L87 Difference]: Start difference. First operand 10996 states and 17614 transitions. Second operand 21 states. [2018-12-03 15:19:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:19:43,557 INFO L93 Difference]: Finished difference Result 16545 states and 27011 transitions. [2018-12-03 15:19:43,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:19:43,557 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-12-03 15:19:43,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:19:43,570 INFO L225 Difference]: With dead ends: 16545 [2018-12-03 15:19:43,571 INFO L226 Difference]: Without dead ends: 16543 [2018-12-03 15:19:43,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1058, Invalid=4642, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:19:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16543 states. [2018-12-03 15:19:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16543 to 12921. [2018-12-03 15:19:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12921 states. [2018-12-03 15:19:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12921 states to 12921 states and 20820 transitions. [2018-12-03 15:19:56,125 INFO L78 Accepts]: Start accepts. Automaton has 12921 states and 20820 transitions. Word has length 28 [2018-12-03 15:19:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:19:56,125 INFO L480 AbstractCegarLoop]: Abstraction has 12921 states and 20820 transitions. [2018-12-03 15:19:56,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:19:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 12921 states and 20820 transitions. [2018-12-03 15:19:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:19:56,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:19:56,131 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:19:56,131 INFO L423 AbstractCegarLoop]: === Iteration 82 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:19:56,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:19:56,131 INFO L82 PathProgramCache]: Analyzing trace with hash -323092399, now seen corresponding path program 3 times [2018-12-03 15:19:56,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:19:56,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:19:56,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:19:56,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:19:56,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:19:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:19:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:19:56,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:19:56,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:19:56,488 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:19:56,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:19:56,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:19:56,489 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:19:56,497 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:19:56,497 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:19:56,508 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:19:56,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:19:56,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:19:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 15:19:56,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:19:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 15:19:56,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:19:56,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 29 [2018-12-03 15:19:56,929 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:19:56,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:19:56,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:19:56,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:19:56,930 INFO L87 Difference]: Start difference. First operand 12921 states and 20820 transitions. Second operand 24 states. [2018-12-03 15:20:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:20,917 INFO L93 Difference]: Finished difference Result 28705 states and 46406 transitions. [2018-12-03 15:20:20,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:20:20,918 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-12-03 15:20:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:20,932 INFO L225 Difference]: With dead ends: 28705 [2018-12-03 15:20:20,932 INFO L226 Difference]: Without dead ends: 16039 [2018-12-03 15:20:20,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1168, Invalid=7574, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:20:20,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16039 states. [2018-12-03 15:20:34,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16039 to 13234. [2018-12-03 15:20:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13234 states. [2018-12-03 15:20:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13234 states to 13234 states and 21347 transitions. [2018-12-03 15:20:34,039 INFO L78 Accepts]: Start accepts. Automaton has 13234 states and 21347 transitions. Word has length 31 [2018-12-03 15:20:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:34,039 INFO L480 AbstractCegarLoop]: Abstraction has 13234 states and 21347 transitions. [2018-12-03 15:20:34,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:20:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 13234 states and 21347 transitions. [2018-12-03 15:20:34,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:20:34,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:34,044 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2018-12-03 15:20:34,044 INFO L423 AbstractCegarLoop]: === Iteration 83 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:34,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:34,044 INFO L82 PathProgramCache]: Analyzing trace with hash 537548598, now seen corresponding path program 4 times [2018-12-03 15:20:34,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:34,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:20:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:34,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 15:20:34,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:34,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:34,231 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:34,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:34,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:34,231 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:34,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:34,240 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:20:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:34,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 15:20:34,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:34,582 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 15:20:34,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:34,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2018-12-03 15:20:34,602 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:34,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:20:34,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:20:34,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:20:34,602 INFO L87 Difference]: Start difference. First operand 13234 states and 21347 transitions. Second operand 24 states. [2018-12-03 15:20:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:54,211 INFO L93 Difference]: Finished difference Result 27515 states and 44327 transitions. [2018-12-03 15:20:54,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:20:54,211 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-12-03 15:20:54,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:54,225 INFO L225 Difference]: With dead ends: 27515 [2018-12-03 15:20:54,225 INFO L226 Difference]: Without dead ends: 14536 [2018-12-03 15:20:54,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1104, Invalid=4446, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 15:20:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14536 states. [2018-12-03 15:21:07,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14536 to 12956. [2018-12-03 15:21:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12956 states. [2018-12-03 15:21:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12956 states to 12956 states and 20861 transitions. [2018-12-03 15:21:07,161 INFO L78 Accepts]: Start accepts. Automaton has 12956 states and 20861 transitions. Word has length 31 [2018-12-03 15:21:07,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:07,161 INFO L480 AbstractCegarLoop]: Abstraction has 12956 states and 20861 transitions. [2018-12-03 15:21:07,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:21:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 12956 states and 20861 transitions. [2018-12-03 15:21:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:21:07,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:07,164 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:21:07,164 INFO L423 AbstractCegarLoop]: === Iteration 84 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:07,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:07,164 INFO L82 PathProgramCache]: Analyzing trace with hash 516576961, now seen corresponding path program 4 times [2018-12-03 15:21:07,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:07,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:07,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:07,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:07,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:21:07,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:07,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:07,426 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:07,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:07,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:07,427 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:07,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:07,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:07,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 15:21:07,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 15:21:07,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:07,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 29 [2018-12-03 15:21:07,791 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:07,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:21:07,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:21:07,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:21:07,791 INFO L87 Difference]: Start difference. First operand 12956 states and 20861 transitions. Second operand 24 states. [2018-12-03 15:21:30,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:30,622 INFO L93 Difference]: Finished difference Result 27069 states and 43688 transitions. [2018-12-03 15:21:30,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 15:21:30,622 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-12-03 15:21:30,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:30,635 INFO L225 Difference]: With dead ends: 27069 [2018-12-03 15:21:30,636 INFO L226 Difference]: Without dead ends: 14384 [2018-12-03 15:21:30,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4737 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2404, Invalid=13096, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 15:21:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14384 states. [2018-12-03 15:21:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14384 to 12929. [2018-12-03 15:21:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12929 states. [2018-12-03 15:21:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12929 states to 12929 states and 20821 transitions. [2018-12-03 15:21:43,665 INFO L78 Accepts]: Start accepts. Automaton has 12929 states and 20821 transitions. Word has length 31 [2018-12-03 15:21:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:43,665 INFO L480 AbstractCegarLoop]: Abstraction has 12929 states and 20821 transitions. [2018-12-03 15:21:43,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:21:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 12929 states and 20821 transitions. [2018-12-03 15:21:43,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:21:43,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:43,668 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:21:43,668 INFO L423 AbstractCegarLoop]: === Iteration 85 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:43,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:43,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1964063353, now seen corresponding path program 1 times [2018-12-03 15:21:43,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:43,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:43,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:43,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:43,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:21:43,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:43,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:43,824 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-03 15:21:43,824 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [15], [19], [25], [26], [27], [30], [32], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 15:21:43,825 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:21:43,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:21:43,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:21:43,838 INFO L272 AbstractInterpreter]: Visited 20 different actions 51 times. Merged at 16 different actions 20 times. Never widened. Found 18 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 15:21:43,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:43,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:21:43,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:43,881 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:43,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:43,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:43,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 15:21:44,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 15:21:44,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:44,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 27 [2018-12-03 15:21:44,285 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:44,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:21:44,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:21:44,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:21:44,286 INFO L87 Difference]: Start difference. First operand 12929 states and 20821 transitions. Second operand 23 states. [2018-12-03 15:22:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:05,914 INFO L93 Difference]: Finished difference Result 28370 states and 45424 transitions. [2018-12-03 15:22:05,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:22:05,914 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-12-03 15:22:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:05,932 INFO L225 Difference]: With dead ends: 28370 [2018-12-03 15:22:05,932 INFO L226 Difference]: Without dead ends: 15590 [2018-12-03 15:22:05,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=582, Invalid=4110, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 15:22:05,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15590 states.