java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:06:58,387 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:06:58,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:06:58,404 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:06:58,405 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:06:58,406 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:06:58,407 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:06:58,409 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:06:58,411 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:06:58,412 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:06:58,413 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:06:58,413 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:06:58,414 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:06:58,415 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:06:58,417 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:06:58,418 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:06:58,419 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:06:58,423 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:06:58,431 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:06:58,436 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:06:58,437 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:06:58,441 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:06:58,446 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:06:58,446 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:06:58,446 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:06:58,447 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:06:58,450 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:06:58,451 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:06:58,451 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:06:58,454 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:06:58,454 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:06:58,455 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:06:58,456 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:06:58,456 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:06:58,457 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:06:58,457 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:06:58,458 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 18:06:58,482 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:06:58,482 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:06:58,483 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:06:58,483 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:06:58,483 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:06:58,484 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:06:58,484 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:06:58,484 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:06:58,484 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:06:58,484 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:06:58,485 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:06:58,485 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:06:58,485 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:06:58,486 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:06:58,486 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:06:58,486 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:06:58,486 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:06:58,487 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:06:58,487 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:06:58,487 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:06:58,487 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:06:58,487 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:06:58,487 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:06:58,488 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:06:58,488 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:06:58,488 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:06:58,488 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:06:58,488 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:06:58,489 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:06:58,489 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:06:58,489 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:06:58,489 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:06:58,489 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:06:58,490 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:06:58,490 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:06:58,490 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:06:58,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:06:58,490 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:06:58,491 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:06:58,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:06:58,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:06:58,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:06:58,559 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:06:58,560 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:06:58,561 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2018-12-03 18:06:58,561 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl' [2018-12-03 18:06:58,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:06:58,596 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:06:58,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:06:58,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:06:58,597 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:06:58,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:06:58" (1/1) ... [2018-12-03 18:06:58,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:06:58" (1/1) ... [2018-12-03 18:06:58,635 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 18:06:58,635 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 18:06:58,636 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 18:06:58,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:06:58,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:06:58,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:06:58,639 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:06:58,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:06:58" (1/1) ... [2018-12-03 18:06:58,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:06:58" (1/1) ... [2018-12-03 18:06:58,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:06:58" (1/1) ... [2018-12-03 18:06:58,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:06:58" (1/1) ... [2018-12-03 18:06:58,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:06:58" (1/1) ... [2018-12-03 18:06:58,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:06:58" (1/1) ... [2018-12-03 18:06:58,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:06:58" (1/1) ... [2018-12-03 18:06:58,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:06:58,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:06:58,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:06:58,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:06:58,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:06:58" (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 18:06:58,740 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 18:06:58,741 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 18:06:58,741 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 18:06:59,034 INFO L272 CfgBuilder]: Using library mode [2018-12-03 18:06:59,034 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 18:06:59,035 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:06:59 BoogieIcfgContainer [2018-12-03 18:06:59,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:06:59,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:06:59,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:06:59,041 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:06:59,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:06:58" (1/2) ... [2018-12-03 18:06:59,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58bf24bb and model type BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:06:59, skipping insertion in model container [2018-12-03 18:06:59,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:06:59" (2/2) ... [2018-12-03 18:06:59,045 INFO L112 eAbstractionObserver]: Analyzing ICFG BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2018-12-03 18:06:59,057 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:06:59,068 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-03 18:06:59,089 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-03 18:06:59,125 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:06:59,125 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:06:59,125 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:06:59,125 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:06:59,126 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:06:59,126 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:06:59,126 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:06:59,126 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:06:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-03 18:06:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:06:59,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:59,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:06:59,154 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:59,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:59,161 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2018-12-03 18:06:59,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:59,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:59,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:06:59,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:59,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:59,307 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 18:06:59,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:06:59,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:06:59,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:06:59,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:06:59,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:06:59,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:06:59,331 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-12-03 18:06:59,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:59,433 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-12-03 18:06:59,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:06:59,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 18:06:59,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:59,446 INFO L225 Difference]: With dead ends: 19 [2018-12-03 18:06:59,447 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 18:06:59,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:06:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 18:06:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 18:06:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 18:06:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 18:06:59,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 3 [2018-12-03 18:06:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:59,484 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 18:06:59,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:06:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 18:06:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:06:59,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:59,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 18:06:59,485 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:59,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:59,486 INFO L82 PathProgramCache]: Analyzing trace with hash 28755427, now seen corresponding path program 1 times [2018-12-03 18:06:59,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:59,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:59,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:06:59,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:59,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:59,592 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 18:06:59,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:59,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:06:59,598 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 18:06:59,604 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [12], [13] [2018-12-03 18:06:59,723 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:06:59,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:06:59,974 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:06:59,978 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 2 different actions 16 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:06:59,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:59,987 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:07:00,025 INFO L219 lantSequenceWeakener]: Could never weaken! [2018-12-03 18:07:00,026 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:07:00,050 INFO L418 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2018-12-03 18:07:00,050 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:07:00,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:07:00,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2018-12-03 18:07:00,052 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:07:00,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:07:00,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:07:00,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:07:00,054 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 3 states. [2018-12-03 18:07:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:00,155 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-12-03 18:07:00,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:07:00,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 18:07:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:00,156 INFO L225 Difference]: With dead ends: 15 [2018-12-03 18:07:00,156 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 18:07:00,158 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:07:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 18:07:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 18:07:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 18:07:00,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-03 18:07:00,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2018-12-03 18:07:00,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:00,162 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-03 18:07:00,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:07:00,163 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-03 18:07:00,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:07:00,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:00,163 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 18:07:00,164 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:00,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:00,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1863919784, now seen corresponding path program 1 times [2018-12-03 18:07:00,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:00,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:00,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:00,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:00,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:07:00,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:00,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:00,247 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-03 18:07:00,248 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [13] [2018-12-03 18:07:00,249 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:07:00,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:07:00,346 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:07:00,346 INFO L272 AbstractInterpreter]: Visited 6 different actions 39 times. Merged at 5 different actions 18 times. Widened at 2 different actions 4 times. Found 4 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:07:00,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:00,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:07:00,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:00,370 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 18:07:00,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:00,382 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:07:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:00,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:07:00,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:07:00,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:00,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 18:07:00,502 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:00,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:07:00,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:07:00,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:07:00,504 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 4 states. [2018-12-03 18:07:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:00,547 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-12-03 18:07:00,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:07:00,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 18:07:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:00,548 INFO L225 Difference]: With dead ends: 19 [2018-12-03 18:07:00,548 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 18:07:00,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:07:00,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 18:07:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 18:07:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 18:07:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-03 18:07:00,555 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2018-12-03 18:07:00,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:00,556 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-03 18:07:00,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:07:00,556 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-03 18:07:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:07:00,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:00,557 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-12-03 18:07:00,557 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:00,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:00,558 INFO L82 PathProgramCache]: Analyzing trace with hash 223461163, now seen corresponding path program 2 times [2018-12-03 18:07:00,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:00,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:00,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:00,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:00,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:07:00,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:00,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:00,688 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:00,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:00,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:00,689 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 18:07:00,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:07:00,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:07:00,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:07:00,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:00,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:07:00,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:07:01,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:01,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2018-12-03 18:07:01,061 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:01,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:07:01,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:07:01,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:07:01,064 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 8 states. [2018-12-03 18:07:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:01,251 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-12-03 18:07:01,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:07:01,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 18:07:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:01,254 INFO L225 Difference]: With dead ends: 27 [2018-12-03 18:07:01,255 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 18:07:01,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:07:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 18:07:01,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-12-03 18:07:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 18:07:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-03 18:07:01,263 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 9 [2018-12-03 18:07:01,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:01,263 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-03 18:07:01,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:07:01,264 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-12-03 18:07:01,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:07:01,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:01,264 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-12-03 18:07:01,265 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:01,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:01,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2120520776, now seen corresponding path program 3 times [2018-12-03 18:07:01,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:01,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:01,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:01,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:01,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:07:01,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:01,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:01,436 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:01,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:01,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:01,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:07:01,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:07:01,447 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:07:01,455 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:07:01,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:01,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:07:01,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:07:01,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:01,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 18:07:01,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:01,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:07:01,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:07:01,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:07:01,553 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 6 states. [2018-12-03 18:07:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:01,613 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2018-12-03 18:07:01,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:07:01,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-03 18:07:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:01,616 INFO L225 Difference]: With dead ends: 31 [2018-12-03 18:07:01,617 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 18:07:01,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:07:01,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 18:07:01,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 18:07:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 18:07:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-03 18:07:01,622 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2018-12-03 18:07:01,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:01,623 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-03 18:07:01,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:07:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-12-03 18:07:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 18:07:01,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:01,624 INFO L402 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-12-03 18:07:01,625 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:01,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1608699707, now seen corresponding path program 4 times [2018-12-03 18:07:01,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:01,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:01,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:01,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:01,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:07:01,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:01,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:01,715 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:01,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:01,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:01,716 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 18:07:01,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:01,727 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:07:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:01,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:07:01,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:07:02,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:02,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 18:07:02,211 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:02,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:07:02,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:07:02,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:07:02,212 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 7 states. [2018-12-03 18:07:02,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:02,323 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-12-03 18:07:02,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:07:02,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-03 18:07:02,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:02,326 INFO L225 Difference]: With dead ends: 33 [2018-12-03 18:07:02,327 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 18:07:02,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:07:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 18:07:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 18:07:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 18:07:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-12-03 18:07:02,332 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2018-12-03 18:07:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:02,333 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-03 18:07:02,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:07:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-12-03 18:07:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 18:07:02,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:02,334 INFO L402 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-12-03 18:07:02,334 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:02,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash -908108290, now seen corresponding path program 5 times [2018-12-03 18:07:02,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:02,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:02,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:02,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:07:02,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:02,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:02,423 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:02,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:02,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:02,423 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 18:07:02,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:07:02,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:07:02,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 18:07:02,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:02,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 18:07:02,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 18:07:02,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:02,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2018-12-03 18:07:02,649 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:02,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:07:02,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:07:02,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:07:02,651 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 12 states. [2018-12-03 18:07:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:02,848 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2018-12-03 18:07:02,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:07:02,848 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-12-03 18:07:02,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:02,849 INFO L225 Difference]: With dead ends: 38 [2018-12-03 18:07:02,849 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 18:07:02,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:07:02,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 18:07:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-03 18:07:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 18:07:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-12-03 18:07:02,856 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2018-12-03 18:07:02,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:02,856 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-03 18:07:02,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:07:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-03 18:07:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 18:07:02,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:02,858 INFO L402 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1] [2018-12-03 18:07:02,858 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:02,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:02,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1220699322, now seen corresponding path program 6 times [2018-12-03 18:07:02,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:02,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:02,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:02,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:02,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:07:02,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:02,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:02,994 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:02,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:02,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:02,994 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 18:07:03,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:07:03,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:07:03,032 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:07:03,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:03,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:07:03,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:07:03,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:03,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 18:07:03,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:03,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:07:03,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:07:03,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:07:03,256 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 9 states. [2018-12-03 18:07:03,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:03,326 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-12-03 18:07:03,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:07:03,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-03 18:07:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:03,328 INFO L225 Difference]: With dead ends: 41 [2018-12-03 18:07:03,328 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 18:07:03,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:07:03,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 18:07:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 18:07:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 18:07:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-03 18:07:03,336 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23 [2018-12-03 18:07:03,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:03,337 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-03 18:07:03,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:07:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-03 18:07:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:07:03,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:03,338 INFO L402 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1] [2018-12-03 18:07:03,338 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:03,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:03,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1267282999, now seen corresponding path program 7 times [2018-12-03 18:07:03,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:03,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:03,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:03,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:03,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:07:03,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:03,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:03,476 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:03,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:03,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:03,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:07:03,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:03,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:07:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:03,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:07:03,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:07:03,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:03,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 18:07:03,750 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:03,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:07:03,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:07:03,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:07:03,752 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 10 states. [2018-12-03 18:07:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:03,807 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-12-03 18:07:03,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:07:03,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-03 18:07:03,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:03,809 INFO L225 Difference]: With dead ends: 43 [2018-12-03 18:07:03,809 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 18:07:03,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:07:03,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 18:07:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 18:07:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 18:07:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-03 18:07:03,816 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 25 [2018-12-03 18:07:03,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:03,817 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-03 18:07:03,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:07:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-03 18:07:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 18:07:03,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:03,818 INFO L402 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1] [2018-12-03 18:07:03,818 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:03,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:03,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1210443660, now seen corresponding path program 8 times [2018-12-03 18:07:03,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:03,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:03,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:03,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:03,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:07:03,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:03,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:03,988 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:03,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:03,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:03,989 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 18:07:04,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:07:04,001 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:07:04,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 18:07:04,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:04,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 18:07:04,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 18:07:04,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:04,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2018-12-03 18:07:04,253 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:04,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:07:04,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:07:04,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:07:04,255 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 16 states. [2018-12-03 18:07:04,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:04,652 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2018-12-03 18:07:04,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:07:04,653 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-12-03 18:07:04,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:04,654 INFO L225 Difference]: With dead ends: 48 [2018-12-03 18:07:04,654 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 18:07:04,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:07:04,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 18:07:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-12-03 18:07:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 18:07:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-12-03 18:07:04,671 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 27 [2018-12-03 18:07:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:04,672 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-12-03 18:07:04,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:07:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-12-03 18:07:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 18:07:04,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:04,673 INFO L402 BasicCegarLoop]: trace histogram [14, 9, 5, 1, 1, 1] [2018-12-03 18:07:04,674 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:04,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2119432620, now seen corresponding path program 9 times [2018-12-03 18:07:04,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:04,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:04,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:04,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:04,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:07:04,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:04,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:04,826 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:04,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:04,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:04,826 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 18:07:04,839 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:07:04,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:07:04,855 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:07:04,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:04,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:07:04,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:07:05,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:05,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 18:07:05,128 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:05,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:07:05,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:07:05,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:07:05,130 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 12 states. [2018-12-03 18:07:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:05,263 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-12-03 18:07:05,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:07:05,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-03 18:07:05,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:05,266 INFO L225 Difference]: With dead ends: 51 [2018-12-03 18:07:05,266 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 18:07:05,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:07:05,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 18:07:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 18:07:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 18:07:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-03 18:07:05,273 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 31 [2018-12-03 18:07:05,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:05,273 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-03 18:07:05,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:07:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-03 18:07:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 18:07:05,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:05,275 INFO L402 BasicCegarLoop]: trace histogram [15, 10, 5, 1, 1, 1] [2018-12-03 18:07:05,275 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:05,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:05,276 INFO L82 PathProgramCache]: Analyzing trace with hash -373685289, now seen corresponding path program 10 times [2018-12-03 18:07:05,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:05,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:05,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:05,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:05,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:07:05,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:05,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:05,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:05,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:05,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:05,527 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 18:07:05,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:05,537 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:07:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:05,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:07:05,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:07:06,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:06,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 18:07:06,038 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:06,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:07:06,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:07:06,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:07:06,040 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 13 states. [2018-12-03 18:07:06,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:06,138 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-12-03 18:07:06,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:07:06,141 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-12-03 18:07:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:06,142 INFO L225 Difference]: With dead ends: 53 [2018-12-03 18:07:06,142 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 18:07:06,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:07:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 18:07:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 18:07:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 18:07:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-03 18:07:06,150 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 33 [2018-12-03 18:07:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:06,151 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-03 18:07:06,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:07:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-12-03 18:07:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 18:07:06,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:06,152 INFO L402 BasicCegarLoop]: trace histogram [16, 11, 5, 1, 1, 1] [2018-12-03 18:07:06,152 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:06,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:06,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2042712934, now seen corresponding path program 11 times [2018-12-03 18:07:06,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:06,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:06,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:06,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:06,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:06,332 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:07:06,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:06,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:06,333 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:06,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:06,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:06,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:07:06,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:07:06,343 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:07:06,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 18:07:06,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:06,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 18:07:06,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 18:07:06,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:06,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 26 [2018-12-03 18:07:06,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:06,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 18:07:06,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 18:07:06,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:07:06,721 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 20 states. [2018-12-03 18:07:06,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:06,809 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-12-03 18:07:06,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 18:07:06,810 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-12-03 18:07:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:06,811 INFO L225 Difference]: With dead ends: 58 [2018-12-03 18:07:06,811 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 18:07:06,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:07:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 18:07:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-12-03 18:07:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 18:07:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-12-03 18:07:06,820 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 35 [2018-12-03 18:07:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:06,820 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-03 18:07:06,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 18:07:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-03 18:07:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 18:07:06,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:06,821 INFO L402 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1] [2018-12-03 18:07:06,822 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:06,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:06,822 INFO L82 PathProgramCache]: Analyzing trace with hash -168899358, now seen corresponding path program 12 times [2018-12-03 18:07:06,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:06,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:06,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:06,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 18:07:07,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:07,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:07,029 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:07,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:07,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:07,029 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 18:07:07,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:07:07,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:07:07,084 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:07:07,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:07,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 18:07:07,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 18:07:07,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:07,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 18:07:07,601 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:07,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:07:07,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:07:07,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:07:07,603 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 15 states. [2018-12-03 18:07:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:07,934 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-12-03 18:07:07,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:07:07,936 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-12-03 18:07:07,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:07,937 INFO L225 Difference]: With dead ends: 61 [2018-12-03 18:07:07,937 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 18:07:07,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:07:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 18:07:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 18:07:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 18:07:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-12-03 18:07:07,943 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 39 [2018-12-03 18:07:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:07,944 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-03 18:07:07,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:07:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-12-03 18:07:07,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 18:07:07,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:07,945 INFO L402 BasicCegarLoop]: trace histogram [19, 13, 6, 1, 1, 1] [2018-12-03 18:07:07,945 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:07,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:07,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2118871195, now seen corresponding path program 13 times [2018-12-03 18:07:07,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:07,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:07,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:07,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:07,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 18:07:08,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:08,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:08,122 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:08,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:08,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:08,122 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 18:07:08,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:08,132 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:07:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:08,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 18:07:08,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 18:07:08,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:08,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 18:07:08,439 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:08,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:07:08,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:07:08,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:07:08,440 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 16 states. [2018-12-03 18:07:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:08,490 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2018-12-03 18:07:08,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:07:08,491 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-12-03 18:07:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:08,492 INFO L225 Difference]: With dead ends: 63 [2018-12-03 18:07:08,492 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 18:07:08,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:07:08,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 18:07:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 18:07:08,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 18:07:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-12-03 18:07:08,499 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 41 [2018-12-03 18:07:08,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:08,500 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-12-03 18:07:08,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:07:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-12-03 18:07:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 18:07:08,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:08,501 INFO L402 BasicCegarLoop]: trace histogram [20, 14, 6, 1, 1, 1] [2018-12-03 18:07:08,501 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:08,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:08,501 INFO L82 PathProgramCache]: Analyzing trace with hash 858901800, now seen corresponding path program 14 times [2018-12-03 18:07:08,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:08,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:08,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:08,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:08,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 210 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 18:07:08,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:08,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:08,693 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:08,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:08,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:08,693 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 18:07:08,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:07:08,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:07:08,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 18:07:08,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:08,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 18:07:08,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 18:07:09,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:09,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2018-12-03 18:07:09,135 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:09,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:07:09,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:07:09,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 18:07:09,136 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 24 states. [2018-12-03 18:07:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:09,435 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2018-12-03 18:07:09,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:07:09,436 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-12-03 18:07:09,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:09,437 INFO L225 Difference]: With dead ends: 68 [2018-12-03 18:07:09,437 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 18:07:09,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 18:07:09,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 18:07:09,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-12-03 18:07:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 18:07:09,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-12-03 18:07:09,446 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 43 [2018-12-03 18:07:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:09,446 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-12-03 18:07:09,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 18:07:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-12-03 18:07:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 18:07:09,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:09,448 INFO L402 BasicCegarLoop]: trace histogram [22, 15, 7, 1, 1, 1] [2018-12-03 18:07:09,448 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:09,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:09,449 INFO L82 PathProgramCache]: Analyzing trace with hash -830075152, now seen corresponding path program 15 times [2018-12-03 18:07:09,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:09,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:09,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:09,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:09,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:07:09,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:09,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:09,843 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:09,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:09,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:09,844 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 18:07:09,853 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:07:09,853 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:07:09,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:07:09,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:09,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:07:09,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:07:10,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:10,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 18:07:10,790 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:10,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:07:10,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:07:10,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:07:10,791 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 18 states. [2018-12-03 18:07:10,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:10,857 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-12-03 18:07:10,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 18:07:10,858 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-12-03 18:07:10,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:10,858 INFO L225 Difference]: With dead ends: 71 [2018-12-03 18:07:10,859 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 18:07:10,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:07:10,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 18:07:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 18:07:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 18:07:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-12-03 18:07:10,868 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 47 [2018-12-03 18:07:10,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:10,868 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-12-03 18:07:10,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:07:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-12-03 18:07:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 18:07:10,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:10,870 INFO L402 BasicCegarLoop]: trace histogram [23, 16, 7, 1, 1, 1] [2018-12-03 18:07:10,870 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:10,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:10,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1545165197, now seen corresponding path program 16 times [2018-12-03 18:07:10,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:10,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:10,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:10,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:10,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:07:11,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:11,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:11,772 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:11,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:11,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:11,772 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 18:07:11,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:11,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:07:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:11,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:07:11,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:07:12,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:12,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 18:07:12,775 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:12,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:07:12,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:07:12,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:07:12,777 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 19 states. [2018-12-03 18:07:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:12,895 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2018-12-03 18:07:12,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 18:07:12,895 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-03 18:07:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:12,896 INFO L225 Difference]: With dead ends: 73 [2018-12-03 18:07:12,896 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 18:07:12,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:07:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 18:07:12,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 18:07:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 18:07:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-12-03 18:07:12,907 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 49 [2018-12-03 18:07:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:12,908 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-12-03 18:07:12,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:07:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-12-03 18:07:12,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 18:07:12,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:12,909 INFO L402 BasicCegarLoop]: trace histogram [24, 17, 7, 1, 1, 1] [2018-12-03 18:07:12,909 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:12,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:12,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1551931082, now seen corresponding path program 17 times [2018-12-03 18:07:12,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:12,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:12,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:12,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:12,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 306 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:07:13,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:13,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:13,153 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:13,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:13,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:13,153 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 18:07:13,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:07:13,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:07:13,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 18:07:13,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:13,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 18:07:13,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 18:07:14,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:14,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 36 [2018-12-03 18:07:14,213 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:14,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 18:07:14,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 18:07:14,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:07:14,215 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 28 states. [2018-12-03 18:07:14,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:14,758 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2018-12-03 18:07:14,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:07:14,758 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2018-12-03 18:07:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:14,759 INFO L225 Difference]: With dead ends: 78 [2018-12-03 18:07:14,759 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 18:07:14,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:07:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 18:07:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-12-03 18:07:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 18:07:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-12-03 18:07:14,774 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 51 [2018-12-03 18:07:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:14,774 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-12-03 18:07:14,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 18:07:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-12-03 18:07:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 18:07:14,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:14,778 INFO L402 BasicCegarLoop]: trace histogram [26, 18, 8, 1, 1, 1] [2018-12-03 18:07:14,778 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:14,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:14,778 INFO L82 PathProgramCache]: Analyzing trace with hash -311825282, now seen corresponding path program 18 times [2018-12-03 18:07:14,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:14,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:14,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:14,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:14,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 18:07:15,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:15,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:15,103 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:15,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:15,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:15,103 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 18:07:15,113 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:07:15,113 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:07:15,133 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:07:15,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:15,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 18:07:15,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 18:07:17,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:17,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 18:07:17,407 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:17,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:07:17,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:07:17,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:07:17,409 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 21 states. [2018-12-03 18:07:18,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:18,198 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2018-12-03 18:07:18,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:07:18,200 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-12-03 18:07:18,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:18,201 INFO L225 Difference]: With dead ends: 81 [2018-12-03 18:07:18,201 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 18:07:18,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:07:18,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 18:07:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 18:07:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 18:07:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-12-03 18:07:18,208 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 55 [2018-12-03 18:07:18,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:18,209 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-12-03 18:07:18,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:07:18,209 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-12-03 18:07:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 18:07:18,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:18,209 INFO L402 BasicCegarLoop]: trace histogram [27, 19, 8, 1, 1, 1] [2018-12-03 18:07:18,209 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:18,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:18,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1622650623, now seen corresponding path program 19 times [2018-12-03 18:07:18,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:18,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:18,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:18,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:18,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 18:07:18,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:18,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:18,494 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:18,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:18,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:18,494 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 18:07:18,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:18,503 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:07:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:18,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:18,544 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 18:07:18,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:19,020 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 18:07:19,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:19,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 18:07:19,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:19,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 18:07:19,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 18:07:19,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:07:19,042 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 22 states. [2018-12-03 18:07:19,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:19,217 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2018-12-03 18:07:19,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:07:19,217 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-12-03 18:07:19,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:19,218 INFO L225 Difference]: With dead ends: 83 [2018-12-03 18:07:19,218 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 18:07:19,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:07:19,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 18:07:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 18:07:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 18:07:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-12-03 18:07:19,226 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 57 [2018-12-03 18:07:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:19,226 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-12-03 18:07:19,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 18:07:19,226 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-12-03 18:07:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 18:07:19,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:19,227 INFO L402 BasicCegarLoop]: trace histogram [28, 20, 8, 1, 1, 1] [2018-12-03 18:07:19,227 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:19,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:19,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1394581700, now seen corresponding path program 20 times [2018-12-03 18:07:19,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:19,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:19,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:19,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:19,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 420 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 18:07:19,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:19,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:19,479 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:19,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:19,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:19,480 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 18:07:19,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:07:19,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:07:19,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 18:07:19,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:19,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:19,723 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 18:07:19,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 18:07:19,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:19,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 41 [2018-12-03 18:07:19,977 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:19,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 18:07:19,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 18:07:19,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 18:07:19,979 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 32 states. [2018-12-03 18:07:20,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:20,133 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2018-12-03 18:07:20,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 18:07:20,137 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2018-12-03 18:07:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:20,138 INFO L225 Difference]: With dead ends: 88 [2018-12-03 18:07:20,138 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 18:07:20,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 18:07:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 18:07:20,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-12-03 18:07:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 18:07:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-12-03 18:07:20,146 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 59 [2018-12-03 18:07:20,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:20,147 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-12-03 18:07:20,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 18:07:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-12-03 18:07:20,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 18:07:20,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:20,148 INFO L402 BasicCegarLoop]: trace histogram [30, 21, 9, 1, 1, 1] [2018-12-03 18:07:20,148 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:20,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:20,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1577747852, now seen corresponding path program 21 times [2018-12-03 18:07:20,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:20,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:20,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:20,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:20,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 18:07:20,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:20,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:20,542 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:20,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:20,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:20,543 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 18:07:20,552 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:07:20,552 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:07:20,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:07:20,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:20,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 18:07:20,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 18:07:21,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:21,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 18:07:21,153 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:21,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:07:21,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:07:21,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:07:21,155 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 24 states. [2018-12-03 18:07:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:21,235 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2018-12-03 18:07:21,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:07:21,236 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-12-03 18:07:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:21,237 INFO L225 Difference]: With dead ends: 91 [2018-12-03 18:07:21,237 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 18:07:21,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:07:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 18:07:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 18:07:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 18:07:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-03 18:07:21,243 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 63 [2018-12-03 18:07:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:21,244 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-03 18:07:21,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 18:07:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-03 18:07:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 18:07:21,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:21,245 INFO L402 BasicCegarLoop]: trace histogram [31, 22, 9, 1, 1, 1] [2018-12-03 18:07:21,245 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:21,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:21,245 INFO L82 PathProgramCache]: Analyzing trace with hash -330713329, now seen corresponding path program 22 times [2018-12-03 18:07:21,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:21,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:21,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:21,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:21,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 18:07:21,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:21,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:21,559 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:21,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:21,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:21,559 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 18:07:21,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:21,568 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:07:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:21,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 18:07:21,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 18:07:22,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:22,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 18:07:22,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:22,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 18:07:22,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 18:07:22,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 18:07:22,766 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 25 states. [2018-12-03 18:07:22,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:22,895 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2018-12-03 18:07:22,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 18:07:22,895 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-12-03 18:07:22,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:22,896 INFO L225 Difference]: With dead ends: 93 [2018-12-03 18:07:22,897 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 18:07:22,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 18:07:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 18:07:22,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 18:07:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 18:07:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-12-03 18:07:22,911 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 65 [2018-12-03 18:07:22,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:22,911 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-12-03 18:07:22,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 18:07:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-12-03 18:07:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 18:07:22,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:22,912 INFO L402 BasicCegarLoop]: trace histogram [32, 23, 9, 1, 1, 1] [2018-12-03 18:07:22,912 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:22,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:22,913 INFO L82 PathProgramCache]: Analyzing trace with hash -410872878, now seen corresponding path program 23 times [2018-12-03 18:07:22,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:22,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:22,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:22,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:22,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 552 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 18:07:23,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:23,216 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:23,217 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:23,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:23,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:23,217 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 18:07:23,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:07:23,228 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:07:23,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 18:07:23,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:23,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 18:07:23,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 18:07:23,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:23,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 46 [2018-12-03 18:07:23,805 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:23,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 18:07:23,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 18:07:23,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:07:23,806 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 36 states. [2018-12-03 18:07:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:24,052 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2018-12-03 18:07:24,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:07:24,053 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-12-03 18:07:24,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:24,053 INFO L225 Difference]: With dead ends: 98 [2018-12-03 18:07:24,053 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 18:07:24,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:07:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 18:07:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-12-03 18:07:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 18:07:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2018-12-03 18:07:24,061 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 67 [2018-12-03 18:07:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:24,061 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-12-03 18:07:24,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 18:07:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-12-03 18:07:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 18:07:24,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:24,062 INFO L402 BasicCegarLoop]: trace histogram [34, 24, 10, 1, 1, 1] [2018-12-03 18:07:24,062 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:24,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:24,062 INFO L82 PathProgramCache]: Analyzing trace with hash -682624486, now seen corresponding path program 24 times [2018-12-03 18:07:24,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:24,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:24,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:24,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:24,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 18:07:24,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:24,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:24,604 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:24,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:24,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:24,605 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 18:07:24,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:07:24,615 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:07:24,644 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:07:24,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:24,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 18:07:24,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 18:07:25,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:25,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 18:07:25,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:25,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 18:07:25,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 18:07:25,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:25,379 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 27 states. [2018-12-03 18:07:25,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:25,468 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2018-12-03 18:07:25,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:07:25,468 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 71 [2018-12-03 18:07:25,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:25,469 INFO L225 Difference]: With dead ends: 101 [2018-12-03 18:07:25,469 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 18:07:25,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 18:07:25,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 18:07:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 18:07:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-12-03 18:07:25,476 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 71 [2018-12-03 18:07:25,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:25,476 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-12-03 18:07:25,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 18:07:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-12-03 18:07:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 18:07:25,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:25,477 INFO L402 BasicCegarLoop]: trace histogram [35, 25, 10, 1, 1, 1] [2018-12-03 18:07:25,477 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:25,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:25,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1361905507, now seen corresponding path program 25 times [2018-12-03 18:07:25,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:25,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:25,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:25,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:25,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 18:07:25,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:25,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:25,936 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:25,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:25,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:25,936 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 18:07:25,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:25,946 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:07:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:25,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 18:07:25,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 18:07:27,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:27,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 51 [2018-12-03 18:07:27,113 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:27,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 18:07:27,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 18:07:27,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:27,116 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 28 states. [2018-12-03 18:07:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:27,408 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2018-12-03 18:07:27,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:07:27,409 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2018-12-03 18:07:27,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:27,409 INFO L225 Difference]: With dead ends: 103 [2018-12-03 18:07:27,410 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 18:07:27,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:27,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 18:07:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 18:07:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 18:07:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-12-03 18:07:27,416 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 73 [2018-12-03 18:07:27,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:27,416 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-12-03 18:07:27,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 18:07:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-12-03 18:07:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 18:07:27,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:27,417 INFO L402 BasicCegarLoop]: trace histogram [36, 26, 10, 1, 1, 1] [2018-12-03 18:07:27,417 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:27,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:27,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1315937696, now seen corresponding path program 26 times [2018-12-03 18:07:27,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:27,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:27,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:27,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:27,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 702 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 18:07:28,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:28,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:28,058 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:28,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:28,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:28,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:07:28,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:07:28,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:07:28,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 18:07:28,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:28,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 18:07:28,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 18:07:28,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:28,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 13] total 51 [2018-12-03 18:07:28,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:28,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 18:07:28,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 18:07:28,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 18:07:28,720 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 40 states. [2018-12-03 18:07:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:28,919 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2018-12-03 18:07:28,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 18:07:28,919 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 75 [2018-12-03 18:07:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:28,920 INFO L225 Difference]: With dead ends: 108 [2018-12-03 18:07:28,920 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 18:07:28,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 18:07:28,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 18:07:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-12-03 18:07:28,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 18:07:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-12-03 18:07:28,927 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 75 [2018-12-03 18:07:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:28,928 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-12-03 18:07:28,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 18:07:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-12-03 18:07:28,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 18:07:28,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:28,928 INFO L402 BasicCegarLoop]: trace histogram [38, 27, 11, 1, 1, 1] [2018-12-03 18:07:28,929 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:28,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:28,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1113953752, now seen corresponding path program 27 times [2018-12-03 18:07:28,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:28,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:28,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:28,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:28,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 18:07:29,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:29,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:29,410 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:29,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:29,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:29,410 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 18:07:29,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:07:29,420 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:07:29,446 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:07:29,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:29,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 18:07:29,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 18:07:30,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:30,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 51 [2018-12-03 18:07:30,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:30,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 18:07:30,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 18:07:30,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:30,184 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 30 states. [2018-12-03 18:07:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:30,291 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2018-12-03 18:07:30,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 18:07:30,291 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-12-03 18:07:30,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:30,292 INFO L225 Difference]: With dead ends: 111 [2018-12-03 18:07:30,292 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 18:07:30,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 18:07:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 18:07:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 18:07:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-12-03 18:07:30,299 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 79 [2018-12-03 18:07:30,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:30,300 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-12-03 18:07:30,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 18:07:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-12-03 18:07:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 18:07:30,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:30,301 INFO L402 BasicCegarLoop]: trace histogram [39, 28, 11, 1, 1, 1] [2018-12-03 18:07:30,301 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:30,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:30,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1203489365, now seen corresponding path program 28 times [2018-12-03 18:07:30,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:30,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:30,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:30,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:30,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 18:07:30,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:30,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:30,715 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:30,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:30,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:30,715 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 18:07:30,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:30,724 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:07:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:30,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 18:07:30,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 18:07:32,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:32,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 51 [2018-12-03 18:07:32,036 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:32,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 18:07:32,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 18:07:32,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:32,038 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 31 states. [2018-12-03 18:07:32,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:32,137 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2018-12-03 18:07:32,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 18:07:32,137 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2018-12-03 18:07:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:32,138 INFO L225 Difference]: With dead ends: 113 [2018-12-03 18:07:32,138 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 18:07:32,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 132 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 18:07:32,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 18:07:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 18:07:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-12-03 18:07:32,146 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 81 [2018-12-03 18:07:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:32,146 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-12-03 18:07:32,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 18:07:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2018-12-03 18:07:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 18:07:32,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:32,147 INFO L402 BasicCegarLoop]: trace histogram [40, 29, 11, 1, 1, 1] [2018-12-03 18:07:32,147 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:32,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:32,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1347867538, now seen corresponding path program 29 times [2018-12-03 18:07:32,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:32,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:32,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:32,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:32,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 630 proven. 870 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 18:07:32,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:32,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:32,873 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:32,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:32,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:32,874 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 18:07:32,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:07:32,893 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:07:32,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 18:07:32,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:32,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 18:07:33,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 18:07:33,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:33,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 14, 14] total 56 [2018-12-03 18:07:33,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:33,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 18:07:33,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 18:07:33,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 18:07:33,681 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 44 states. [2018-12-03 18:07:33,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:33,865 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2018-12-03 18:07:33,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 18:07:33,865 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 83 [2018-12-03 18:07:33,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:33,866 INFO L225 Difference]: With dead ends: 118 [2018-12-03 18:07:33,866 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 18:07:33,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 18:07:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 18:07:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-12-03 18:07:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 18:07:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-12-03 18:07:33,872 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 83 [2018-12-03 18:07:33,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:33,872 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-12-03 18:07:33,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 18:07:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-12-03 18:07:33,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 18:07:33,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:33,873 INFO L402 BasicCegarLoop]: trace histogram [42, 30, 12, 1, 1, 1] [2018-12-03 18:07:33,874 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:33,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:33,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1530792522, now seen corresponding path program 30 times [2018-12-03 18:07:33,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:33,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:33,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:33,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:33,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 18:07:34,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:34,291 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:34,291 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:34,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:34,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:34,292 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 18:07:34,301 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:07:34,301 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:07:34,327 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:07:34,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:34,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 18:07:34,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 18:07:35,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:35,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 51 [2018-12-03 18:07:35,164 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:35,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 18:07:35,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 18:07:35,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:35,166 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 33 states. [2018-12-03 18:07:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:35,315 INFO L93 Difference]: Finished difference Result 121 states and 146 transitions. [2018-12-03 18:07:35,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 18:07:35,315 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-12-03 18:07:35,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:35,316 INFO L225 Difference]: With dead ends: 121 [2018-12-03 18:07:35,317 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 18:07:35,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 142 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 18:07:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 18:07:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 18:07:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2018-12-03 18:07:35,325 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 87 [2018-12-03 18:07:35,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:35,326 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2018-12-03 18:07:35,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 18:07:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2018-12-03 18:07:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 18:07:35,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:35,327 INFO L402 BasicCegarLoop]: trace histogram [43, 31, 12, 1, 1, 1] [2018-12-03 18:07:35,327 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:35,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:35,327 INFO L82 PathProgramCache]: Analyzing trace with hash 158699065, now seen corresponding path program 31 times [2018-12-03 18:07:35,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:35,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:35,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:35,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:35,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 18:07:35,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:35,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:35,787 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:35,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:35,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:35,787 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 18:07:35,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:35,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:07:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:35,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 18:07:35,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 18:07:36,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:36,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2018-12-03 18:07:36,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:36,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 18:07:36,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 18:07:36,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:36,693 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 34 states. [2018-12-03 18:07:36,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:36,804 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2018-12-03 18:07:36,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 18:07:36,805 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 89 [2018-12-03 18:07:36,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:36,806 INFO L225 Difference]: With dead ends: 123 [2018-12-03 18:07:36,806 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 18:07:36,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 145 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:36,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 18:07:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 18:07:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 18:07:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2018-12-03 18:07:36,814 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 89 [2018-12-03 18:07:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:36,814 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2018-12-03 18:07:36,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 18:07:36,815 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2018-12-03 18:07:36,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 18:07:36,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:36,815 INFO L402 BasicCegarLoop]: trace histogram [44, 32, 12, 1, 1, 1] [2018-12-03 18:07:36,816 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:36,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:36,816 INFO L82 PathProgramCache]: Analyzing trace with hash 262476284, now seen corresponding path program 32 times [2018-12-03 18:07:36,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:36,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:36,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:36,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:36,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 759 proven. 1056 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 18:07:37,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:37,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:37,398 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:37,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:37,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:37,398 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 18:07:37,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:07:37,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:07:37,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 18:07:37,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:37,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 18:07:38,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 18:07:38,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:38,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 15, 15] total 61 [2018-12-03 18:07:38,994 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:38,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 18:07:38,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 18:07:38,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 18:07:38,995 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 48 states. [2018-12-03 18:07:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:39,223 INFO L93 Difference]: Finished difference Result 128 states and 156 transitions. [2018-12-03 18:07:39,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 18:07:39,226 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 91 [2018-12-03 18:07:39,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:39,227 INFO L225 Difference]: With dead ends: 128 [2018-12-03 18:07:39,227 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 18:07:39,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 18:07:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 18:07:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-12-03 18:07:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 18:07:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2018-12-03 18:07:39,235 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 91 [2018-12-03 18:07:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:39,235 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2018-12-03 18:07:39,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 18:07:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2018-12-03 18:07:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 18:07:39,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:39,236 INFO L402 BasicCegarLoop]: trace histogram [46, 33, 13, 1, 1, 1] [2018-12-03 18:07:39,236 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:39,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:39,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1377221828, now seen corresponding path program 33 times [2018-12-03 18:07:39,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:39,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:39,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:39,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:39,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 18:07:40,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:40,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:40,046 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:40,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:40,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:40,046 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 18:07:40,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:07:40,056 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:07:40,083 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:07:40,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:40,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 18:07:40,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 18:07:40,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:40,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 51 [2018-12-03 18:07:40,950 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:40,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 18:07:40,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 18:07:40,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:40,951 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 36 states. [2018-12-03 18:07:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:41,084 INFO L93 Difference]: Finished difference Result 131 states and 158 transitions. [2018-12-03 18:07:41,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:07:41,085 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 95 [2018-12-03 18:07:41,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:41,086 INFO L225 Difference]: With dead ends: 131 [2018-12-03 18:07:41,086 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 18:07:41,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 155 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:41,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 18:07:41,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 18:07:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 18:07:41,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2018-12-03 18:07:41,094 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 95 [2018-12-03 18:07:41,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:41,095 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2018-12-03 18:07:41,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 18:07:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2018-12-03 18:07:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 18:07:41,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:41,096 INFO L402 BasicCegarLoop]: trace histogram [47, 34, 13, 1, 1, 1] [2018-12-03 18:07:41,096 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:41,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:41,096 INFO L82 PathProgramCache]: Analyzing trace with hash -726195641, now seen corresponding path program 34 times [2018-12-03 18:07:41,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:41,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:41,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 18:07:43,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:43,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:43,037 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:43,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:43,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:43,038 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 18:07:43,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:43,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:07:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:43,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 18:07:43,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 18:07:44,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:44,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 51 [2018-12-03 18:07:44,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:44,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 18:07:44,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 18:07:44,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:44,103 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 37 states. [2018-12-03 18:07:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:44,268 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2018-12-03 18:07:44,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 18:07:44,269 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 97 [2018-12-03 18:07:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:44,270 INFO L225 Difference]: With dead ends: 133 [2018-12-03 18:07:44,270 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 18:07:44,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 158 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 18:07:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 18:07:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 18:07:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2018-12-03 18:07:44,277 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 97 [2018-12-03 18:07:44,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:44,277 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2018-12-03 18:07:44,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 18:07:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2018-12-03 18:07:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 18:07:44,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:44,278 INFO L402 BasicCegarLoop]: trace histogram [48, 35, 13, 1, 1, 1] [2018-12-03 18:07:44,279 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:44,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:44,279 INFO L82 PathProgramCache]: Analyzing trace with hash 819213066, now seen corresponding path program 35 times [2018-12-03 18:07:44,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:44,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:44,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:44,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:44,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 900 proven. 1260 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 18:07:44,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:44,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:44,896 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:44,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:44,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:44,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:07:44,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:07:44,905 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:07:44,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 18:07:44,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:44,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 18:07:45,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 18:07:45,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:45,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 16, 16] total 66 [2018-12-03 18:07:45,948 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:45,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 18:07:45,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 18:07:45,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 18:07:45,950 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 52 states. [2018-12-03 18:07:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:46,182 INFO L93 Difference]: Finished difference Result 138 states and 168 transitions. [2018-12-03 18:07:46,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 18:07:46,182 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 99 [2018-12-03 18:07:46,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:46,183 INFO L225 Difference]: With dead ends: 138 [2018-12-03 18:07:46,184 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 18:07:46,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 18:07:46,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 18:07:46,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-12-03 18:07:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 18:07:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-12-03 18:07:46,191 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 99 [2018-12-03 18:07:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:46,191 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-12-03 18:07:46,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 18:07:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-12-03 18:07:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 18:07:46,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:46,192 INFO L402 BasicCegarLoop]: trace histogram [50, 36, 14, 1, 1, 1] [2018-12-03 18:07:46,192 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:46,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:46,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1046536018, now seen corresponding path program 36 times [2018-12-03 18:07:46,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:46,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:46,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:46,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:46,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 18:07:46,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:46,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:46,934 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:46,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:46,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:46,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:07:46,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:07:46,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:07:46,972 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:07:46,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:46,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 18:07:46,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 18:07:47,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:47,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 51 [2018-12-03 18:07:47,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:47,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 18:07:47,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 18:07:47,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:47,906 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 39 states. [2018-12-03 18:07:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:48,183 INFO L93 Difference]: Finished difference Result 141 states and 170 transitions. [2018-12-03 18:07:48,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 18:07:48,184 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 103 [2018-12-03 18:07:48,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:48,184 INFO L225 Difference]: With dead ends: 141 [2018-12-03 18:07:48,184 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 18:07:48,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 168 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 18:07:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 18:07:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 18:07:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2018-12-03 18:07:48,195 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 103 [2018-12-03 18:07:48,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:48,195 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2018-12-03 18:07:48,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 18:07:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2018-12-03 18:07:48,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 18:07:48,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:48,196 INFO L402 BasicCegarLoop]: trace histogram [51, 37, 14, 1, 1, 1] [2018-12-03 18:07:48,197 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:48,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:48,197 INFO L82 PathProgramCache]: Analyzing trace with hash -3075627, now seen corresponding path program 37 times [2018-12-03 18:07:48,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:48,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:48,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:48,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:48,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 18:07:48,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:48,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:48,923 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:48,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:48,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:48,923 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 18:07:48,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:48,932 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:07:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:48,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 18:07:48,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 18:07:49,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:49,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 51 [2018-12-03 18:07:49,909 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:49,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 18:07:49,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 18:07:49,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:49,910 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 40 states. [2018-12-03 18:07:50,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:50,086 INFO L93 Difference]: Finished difference Result 143 states and 172 transitions. [2018-12-03 18:07:50,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 18:07:50,086 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 105 [2018-12-03 18:07:50,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:50,087 INFO L225 Difference]: With dead ends: 143 [2018-12-03 18:07:50,087 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 18:07:50,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 171 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:50,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 18:07:50,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 18:07:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 18:07:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-12-03 18:07:50,095 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 105 [2018-12-03 18:07:50,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:50,096 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-12-03 18:07:50,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 18:07:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-12-03 18:07:50,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 18:07:50,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:50,097 INFO L402 BasicCegarLoop]: trace histogram [52, 38, 14, 1, 1, 1] [2018-12-03 18:07:50,097 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:50,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:50,098 INFO L82 PathProgramCache]: Analyzing trace with hash 637448088, now seen corresponding path program 38 times [2018-12-03 18:07:50,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:50,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:50,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:50,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:50,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1053 proven. 1482 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 18:07:50,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:50,779 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:50,780 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:50,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:50,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:50,780 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 18:07:50,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:07:50,789 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:07:50,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 18:07:50,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:50,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 18:07:51,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 18:07:52,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:52,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 17, 17] total 71 [2018-12-03 18:07:52,032 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:52,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 18:07:52,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 18:07:52,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 18:07:52,033 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 56 states. [2018-12-03 18:07:53,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:53,272 INFO L93 Difference]: Finished difference Result 148 states and 180 transitions. [2018-12-03 18:07:53,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 18:07:53,274 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 107 [2018-12-03 18:07:53,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:53,275 INFO L225 Difference]: With dead ends: 148 [2018-12-03 18:07:53,275 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 18:07:53,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 18:07:53,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 18:07:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-12-03 18:07:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 18:07:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-12-03 18:07:53,284 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 107 [2018-12-03 18:07:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:53,284 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-12-03 18:07:53,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 18:07:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-12-03 18:07:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 18:07:53,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:53,285 INFO L402 BasicCegarLoop]: trace histogram [54, 39, 15, 1, 1, 1] [2018-12-03 18:07:53,286 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:53,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:53,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1746895520, now seen corresponding path program 39 times [2018-12-03 18:07:53,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:53,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:53,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:53,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:53,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 18:07:54,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:54,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:54,001 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:54,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:54,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:54,002 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 18:07:54,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:07:54,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:07:54,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:07:54,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:54,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 18:07:54,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 18:07:55,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:55,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 51 [2018-12-03 18:07:55,317 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:55,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 18:07:55,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 18:07:55,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:55,318 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 42 states. [2018-12-03 18:07:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:55,499 INFO L93 Difference]: Finished difference Result 151 states and 182 transitions. [2018-12-03 18:07:55,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 18:07:55,500 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-12-03 18:07:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:55,501 INFO L225 Difference]: With dead ends: 151 [2018-12-03 18:07:55,501 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 18:07:55,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 181 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 18:07:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 18:07:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 18:07:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2018-12-03 18:07:55,509 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 111 [2018-12-03 18:07:55,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:55,509 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2018-12-03 18:07:55,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 18:07:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2018-12-03 18:07:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 18:07:55,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:55,510 INFO L402 BasicCegarLoop]: trace histogram [55, 40, 15, 1, 1, 1] [2018-12-03 18:07:55,510 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:55,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:55,511 INFO L82 PathProgramCache]: Analyzing trace with hash 637762787, now seen corresponding path program 40 times [2018-12-03 18:07:55,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:55,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:55,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:55,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:55,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 18:07:56,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:56,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:56,306 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:56,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:56,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:56,306 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 18:07:56,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:56,315 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:07:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:56,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 18:07:56,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 18:07:57,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:57,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 51 [2018-12-03 18:07:57,468 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:57,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 18:07:57,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 18:07:57,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:57,469 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand 43 states. [2018-12-03 18:07:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:57,629 INFO L93 Difference]: Finished difference Result 153 states and 184 transitions. [2018-12-03 18:07:57,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 18:07:57,629 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 113 [2018-12-03 18:07:57,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:57,631 INFO L225 Difference]: With dead ends: 153 [2018-12-03 18:07:57,631 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 18:07:57,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 184 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:07:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 18:07:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 18:07:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 18:07:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2018-12-03 18:07:57,639 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 113 [2018-12-03 18:07:57,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:57,640 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2018-12-03 18:07:57,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 18:07:57,640 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2018-12-03 18:07:57,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 18:07:57,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:57,641 INFO L402 BasicCegarLoop]: trace histogram [56, 41, 15, 1, 1, 1] [2018-12-03 18:07:57,641 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:57,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:57,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1218140250, now seen corresponding path program 41 times [2018-12-03 18:07:57,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:57,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:57,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:57,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:57,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1218 proven. 1722 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 18:07:58,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:58,819 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:58,819 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:58,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:58,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:58,820 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 18:07:58,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:07:58,829 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:07:58,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 18:07:58,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:58,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 18:07:59,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 18:08:00,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:00,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 18, 18] total 76 [2018-12-03 18:08:00,194 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:00,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 18:08:00,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 18:08:00,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:08:00,196 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 60 states. [2018-12-03 18:08:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:00,540 INFO L93 Difference]: Finished difference Result 158 states and 192 transitions. [2018-12-03 18:08:00,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 18:08:00,541 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 115 [2018-12-03 18:08:00,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:00,542 INFO L225 Difference]: With dead ends: 158 [2018-12-03 18:08:00,542 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 18:08:00,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:08:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 18:08:00,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-12-03 18:08:00,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 18:08:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-12-03 18:08:00,552 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 115 [2018-12-03 18:08:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:00,553 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-12-03 18:08:00,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 18:08:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-12-03 18:08:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 18:08:00,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:00,554 INFO L402 BasicCegarLoop]: trace histogram [58, 42, 16, 1, 1, 1] [2018-12-03 18:08:00,554 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:00,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:00,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1001539858, now seen corresponding path program 42 times [2018-12-03 18:08:00,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:00,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:00,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:00,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:00,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 18:08:01,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:01,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:01,797 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:01,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:01,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:01,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:08:01,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:08:01,806 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:08:01,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:08:01,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:01,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 18:08:01,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 18:08:02,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:02,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 51 [2018-12-03 18:08:02,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:02,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 18:08:02,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 18:08:02,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:02,887 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 45 states. [2018-12-03 18:08:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:03,075 INFO L93 Difference]: Finished difference Result 161 states and 194 transitions. [2018-12-03 18:08:03,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 18:08:03,086 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 119 [2018-12-03 18:08:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:03,087 INFO L225 Difference]: With dead ends: 161 [2018-12-03 18:08:03,087 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 18:08:03,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 194 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:03,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 18:08:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 18:08:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 18:08:03,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2018-12-03 18:08:03,097 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 119 [2018-12-03 18:08:03,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:03,097 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2018-12-03 18:08:03,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 18:08:03,098 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2018-12-03 18:08:03,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 18:08:03,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:03,098 INFO L402 BasicCegarLoop]: trace histogram [59, 43, 16, 1, 1, 1] [2018-12-03 18:08:03,099 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:03,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:03,099 INFO L82 PathProgramCache]: Analyzing trace with hash 436634481, now seen corresponding path program 43 times [2018-12-03 18:08:03,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:03,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:03,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:03,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:03,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 18:08:04,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:04,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:04,098 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:04,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:04,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:04,098 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 18:08:04,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:08:04,107 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:08:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:04,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 18:08:04,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:05,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 18:08:05,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:05,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 51 [2018-12-03 18:08:05,065 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:05,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 18:08:05,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 18:08:05,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:05,067 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 46 states. [2018-12-03 18:08:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:05,294 INFO L93 Difference]: Finished difference Result 163 states and 196 transitions. [2018-12-03 18:08:05,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 18:08:05,294 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 121 [2018-12-03 18:08:05,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:05,296 INFO L225 Difference]: With dead ends: 163 [2018-12-03 18:08:05,296 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 18:08:05,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 197 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:05,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 18:08:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 18:08:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 18:08:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-12-03 18:08:05,305 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 121 [2018-12-03 18:08:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:05,306 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-12-03 18:08:05,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 18:08:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-12-03 18:08:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 18:08:05,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:05,307 INFO L402 BasicCegarLoop]: trace histogram [60, 44, 16, 1, 1, 1] [2018-12-03 18:08:05,307 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:05,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:05,307 INFO L82 PathProgramCache]: Analyzing trace with hash -457295052, now seen corresponding path program 44 times [2018-12-03 18:08:05,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:05,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:05,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:08:05,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:05,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:06,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1395 proven. 1980 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 18:08:06,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:06,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:06,135 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:06,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:06,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:06,136 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 18:08:06,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:08:06,145 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:08:06,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 18:08:06,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:06,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 18:08:06,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 18:08:07,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:07,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 19, 19] total 81 [2018-12-03 18:08:07,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:07,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 18:08:07,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 18:08:07,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 18:08:07,830 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand 64 states. [2018-12-03 18:08:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:08,168 INFO L93 Difference]: Finished difference Result 168 states and 204 transitions. [2018-12-03 18:08:08,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 18:08:08,168 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 123 [2018-12-03 18:08:08,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:08,169 INFO L225 Difference]: With dead ends: 168 [2018-12-03 18:08:08,169 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 18:08:08,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 18:08:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 18:08:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-12-03 18:08:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 18:08:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2018-12-03 18:08:08,179 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 123 [2018-12-03 18:08:08,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:08,180 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2018-12-03 18:08:08,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 18:08:08,180 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2018-12-03 18:08:08,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 18:08:08,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:08,181 INFO L402 BasicCegarLoop]: trace histogram [62, 45, 17, 1, 1, 1] [2018-12-03 18:08:08,181 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:08,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:08,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1658366972, now seen corresponding path program 45 times [2018-12-03 18:08:08,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:08,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:08,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:08,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:08,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 18:08:09,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:09,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:09,175 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:09,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:09,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:09,175 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 18:08:09,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:08:09,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:08:09,225 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:08:09,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:09,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 18:08:09,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 18:08:10,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:10,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 51 [2018-12-03 18:08:10,225 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:10,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 18:08:10,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 18:08:10,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:10,226 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand 48 states. [2018-12-03 18:08:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:10,465 INFO L93 Difference]: Finished difference Result 171 states and 206 transitions. [2018-12-03 18:08:10,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 18:08:10,466 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-12-03 18:08:10,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:10,467 INFO L225 Difference]: With dead ends: 171 [2018-12-03 18:08:10,467 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 18:08:10,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 207 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 18:08:10,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 18:08:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 18:08:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2018-12-03 18:08:10,478 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 127 [2018-12-03 18:08:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:10,478 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2018-12-03 18:08:10,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 18:08:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2018-12-03 18:08:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 18:08:10,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:10,479 INFO L402 BasicCegarLoop]: trace histogram [63, 46, 17, 1, 1, 1] [2018-12-03 18:08:10,479 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:10,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:10,480 INFO L82 PathProgramCache]: Analyzing trace with hash -401980033, now seen corresponding path program 46 times [2018-12-03 18:08:10,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:10,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:10,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:10,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:10,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 18:08:11,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:11,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:11,379 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:11,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:11,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:11,379 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 18:08:11,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:08:11,389 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:08:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:11,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 18:08:11,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 18:08:12,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:12,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 51 [2018-12-03 18:08:12,409 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:12,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 18:08:12,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 18:08:12,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:12,410 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand 49 states. [2018-12-03 18:08:12,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:12,565 INFO L93 Difference]: Finished difference Result 173 states and 208 transitions. [2018-12-03 18:08:12,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 18:08:12,566 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 129 [2018-12-03 18:08:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:12,567 INFO L225 Difference]: With dead ends: 173 [2018-12-03 18:08:12,567 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 18:08:12,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 210 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 18:08:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-03 18:08:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 18:08:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2018-12-03 18:08:12,577 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 129 [2018-12-03 18:08:12,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:12,578 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2018-12-03 18:08:12,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 18:08:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2018-12-03 18:08:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 18:08:12,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:12,579 INFO L402 BasicCegarLoop]: trace histogram [64, 47, 17, 1, 1, 1] [2018-12-03 18:08:12,579 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:12,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:12,580 INFO L82 PathProgramCache]: Analyzing trace with hash -415528382, now seen corresponding path program 47 times [2018-12-03 18:08:12,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:12,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:12,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:08:12,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:12,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1584 proven. 2256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 18:08:13,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:13,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:13,647 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:13,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:13,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:13,647 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 18:08:13,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:08:13,656 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:08:13,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 18:08:13,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:13,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 18:08:14,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 18:08:15,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:15,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 20, 20] total 86 [2018-12-03 18:08:15,469 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:15,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 18:08:15,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 18:08:15,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 18:08:15,471 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand 68 states. [2018-12-03 18:08:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:16,408 INFO L93 Difference]: Finished difference Result 178 states and 216 transitions. [2018-12-03 18:08:16,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 18:08:16,408 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 131 [2018-12-03 18:08:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:16,410 INFO L225 Difference]: With dead ends: 178 [2018-12-03 18:08:16,410 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 18:08:16,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 18:08:16,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 18:08:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-12-03 18:08:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 18:08:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2018-12-03 18:08:16,421 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 131 [2018-12-03 18:08:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:16,422 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2018-12-03 18:08:16,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 18:08:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2018-12-03 18:08:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 18:08:16,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:16,423 INFO L402 BasicCegarLoop]: trace histogram [66, 48, 18, 1, 1, 1] [2018-12-03 18:08:16,423 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:16,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:16,424 INFO L82 PathProgramCache]: Analyzing trace with hash -836141942, now seen corresponding path program 48 times [2018-12-03 18:08:16,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:16,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:16,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:16,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:16,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 18:08:18,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:18,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:18,272 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:18,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:18,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:18,272 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 18:08:18,283 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:08:18,283 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:08:18,322 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:08:18,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:18,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 18:08:18,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 18:08:19,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:19,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 51 [2018-12-03 18:08:19,591 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:19,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 18:08:19,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 18:08:19,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:19,592 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand 51 states. [2018-12-03 18:08:19,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:19,778 INFO L93 Difference]: Finished difference Result 181 states and 218 transitions. [2018-12-03 18:08:19,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 18:08:19,779 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 135 [2018-12-03 18:08:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:19,780 INFO L225 Difference]: With dead ends: 181 [2018-12-03 18:08:19,780 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 18:08:19,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 220 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 18:08:19,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 18:08:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 18:08:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2018-12-03 18:08:19,788 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 135 [2018-12-03 18:08:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:19,788 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2018-12-03 18:08:19,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 18:08:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2018-12-03 18:08:19,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 18:08:19,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:19,789 INFO L402 BasicCegarLoop]: trace histogram [67, 49, 18, 1, 1, 1] [2018-12-03 18:08:19,789 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:19,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:19,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1471603469, now seen corresponding path program 49 times [2018-12-03 18:08:19,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:19,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:19,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:19,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:19,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 18:08:20,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:20,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:20,981 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:20,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:20,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:20,981 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 18:08:20,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:08:20,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:08:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:21,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 18:08:21,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 18:08:22,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:22,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 18:08:22,055 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:22,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 18:08:22,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 18:08:22,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:22,056 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand 52 states. [2018-12-03 18:08:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:22,199 INFO L93 Difference]: Finished difference Result 183 states and 220 transitions. [2018-12-03 18:08:22,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 18:08:22,200 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 137 [2018-12-03 18:08:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:22,202 INFO L225 Difference]: With dead ends: 183 [2018-12-03 18:08:22,202 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 18:08:22,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 223 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:22,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 18:08:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 18:08:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 18:08:22,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2018-12-03 18:08:22,211 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 137 [2018-12-03 18:08:22,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:22,212 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2018-12-03 18:08:22,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 18:08:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2018-12-03 18:08:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 18:08:22,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:22,213 INFO L402 BasicCegarLoop]: trace histogram [68, 50, 18, 1, 1, 1] [2018-12-03 18:08:22,213 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:22,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:22,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1283148592, now seen corresponding path program 50 times [2018-12-03 18:08:22,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:22,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:22,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:08:22,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:22,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:23,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1968 proven. 400 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:08:23,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:23,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:23,492 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:23,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:23,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:23,492 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 18:08:23,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:08:23,502 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:08:23,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 18:08:23,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:23,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:23,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:08:23,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:08:24,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:24,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 42 [2018-12-03 18:08:24,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:24,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:08:24,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:08:24,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:08:24,308 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 23 states. [2018-12-03 18:08:24,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:24,409 INFO L93 Difference]: Finished difference Result 153 states and 177 transitions. [2018-12-03 18:08:24,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 18:08:24,409 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 139 [2018-12-03 18:08:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:24,411 INFO L225 Difference]: With dead ends: 153 [2018-12-03 18:08:24,411 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 18:08:24,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:08:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 18:08:24,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-12-03 18:08:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 18:08:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 169 transitions. [2018-12-03 18:08:24,421 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 169 transitions. Word has length 139 [2018-12-03 18:08:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:24,421 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 169 transitions. [2018-12-03 18:08:24,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:08:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2018-12-03 18:08:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 18:08:24,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:24,423 INFO L402 BasicCegarLoop]: trace histogram [71, 50, 21, 1, 1, 1] [2018-12-03 18:08:24,423 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:24,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:24,423 INFO L82 PathProgramCache]: Analyzing trace with hash -772821089, now seen corresponding path program 51 times [2018-12-03 18:08:24,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:24,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:24,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:24,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:24,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2256 proven. 529 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:08:26,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:26,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:26,531 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:26,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:26,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:26,532 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 18:08:26,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:08:26,542 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:08:26,593 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:08:26,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:26,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:27,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:27,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:30,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:30,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 73, 73] total 102 [2018-12-03 18:08:30,267 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:30,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 18:08:30,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 18:08:30,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:08:30,269 INFO L87 Difference]: Start difference. First operand 148 states and 169 transitions. Second operand 76 states. [2018-12-03 18:08:30,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:30,685 INFO L93 Difference]: Finished difference Result 159 states and 186 transitions. [2018-12-03 18:08:30,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 18:08:30,685 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 145 [2018-12-03 18:08:30,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:30,686 INFO L225 Difference]: With dead ends: 159 [2018-12-03 18:08:30,686 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 18:08:30,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 168 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10537 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:08:30,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 18:08:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2018-12-03 18:08:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 18:08:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2018-12-03 18:08:30,693 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 178 transitions. Word has length 145 [2018-12-03 18:08:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:30,694 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 178 transitions. [2018-12-03 18:08:30,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 18:08:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2018-12-03 18:08:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 18:08:30,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:30,695 INFO L402 BasicCegarLoop]: trace histogram [74, 50, 24, 1, 1, 1] [2018-12-03 18:08:30,695 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:30,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:30,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1797188818, now seen corresponding path program 52 times [2018-12-03 18:08:30,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:30,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:30,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:30,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:30,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2544 proven. 676 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:08:31,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:31,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:31,138 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:31,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:31,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:31,138 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 18:08:31,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:08:31,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:08:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:31,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:32,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:34,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:34,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 76, 76] total 102 [2018-12-03 18:08:34,264 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:34,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 18:08:34,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 18:08:34,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:08:34,266 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. Second operand 79 states. [2018-12-03 18:08:34,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:34,737 INFO L93 Difference]: Finished difference Result 165 states and 195 transitions. [2018-12-03 18:08:34,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 18:08:34,738 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 151 [2018-12-03 18:08:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:34,739 INFO L225 Difference]: With dead ends: 165 [2018-12-03 18:08:34,739 INFO L226 Difference]: Without dead ends: 161 [2018-12-03 18:08:34,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 177 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11272 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:08:34,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-03 18:08:34,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-12-03 18:08:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 18:08:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 187 transitions. [2018-12-03 18:08:34,746 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 187 transitions. Word has length 151 [2018-12-03 18:08:34,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:34,746 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 187 transitions. [2018-12-03 18:08:34,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 18:08:34,746 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2018-12-03 18:08:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 18:08:34,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:34,747 INFO L402 BasicCegarLoop]: trace histogram [77, 50, 27, 1, 1, 1] [2018-12-03 18:08:34,747 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:34,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:34,747 INFO L82 PathProgramCache]: Analyzing trace with hash 882331517, now seen corresponding path program 53 times [2018-12-03 18:08:34,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:34,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:34,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:08:34,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:34,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2832 proven. 841 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:08:36,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:36,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:36,064 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:36,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:36,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:36,065 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 18:08:36,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:08:36,074 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:08:36,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 18:08:36,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:36,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:08:36,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:08:36,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:36,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 52 [2018-12-03 18:08:36,913 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:36,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 18:08:36,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 18:08:36,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:36,915 INFO L87 Difference]: Start difference. First operand 160 states and 187 transitions. Second operand 32 states. [2018-12-03 18:08:37,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:37,058 INFO L93 Difference]: Finished difference Result 171 states and 204 transitions. [2018-12-03 18:08:37,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 18:08:37,058 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 157 [2018-12-03 18:08:37,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:37,060 INFO L225 Difference]: With dead ends: 171 [2018-12-03 18:08:37,060 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 18:08:37,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 286 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:37,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 18:08:37,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-12-03 18:08:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 18:08:37,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 196 transitions. [2018-12-03 18:08:37,069 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 196 transitions. Word has length 157 [2018-12-03 18:08:37,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:37,070 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 196 transitions. [2018-12-03 18:08:37,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 18:08:37,070 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 196 transitions. [2018-12-03 18:08:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 18:08:37,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:37,071 INFO L402 BasicCegarLoop]: trace histogram [80, 50, 30, 1, 1, 1] [2018-12-03 18:08:37,071 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:37,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:37,072 INFO L82 PathProgramCache]: Analyzing trace with hash -54733684, now seen corresponding path program 54 times [2018-12-03 18:08:37,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:37,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:37,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:37,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:37,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3120 proven. 1024 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:08:37,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:37,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:37,757 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:37,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:37,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:37,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 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 18:08:37,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:08:37,768 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:08:37,833 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:08:37,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:37,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:38,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:40,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:40,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 82, 82] total 102 [2018-12-03 18:08:40,750 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:40,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 18:08:40,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 18:08:40,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:08:40,752 INFO L87 Difference]: Start difference. First operand 166 states and 196 transitions. Second operand 85 states. [2018-12-03 18:08:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:41,369 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2018-12-03 18:08:41,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 18:08:41,369 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 163 [2018-12-03 18:08:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:41,371 INFO L225 Difference]: With dead ends: 177 [2018-12-03 18:08:41,371 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 18:08:41,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 195 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12742 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:08:41,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 18:08:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-12-03 18:08:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 18:08:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 205 transitions. [2018-12-03 18:08:41,381 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 205 transitions. Word has length 163 [2018-12-03 18:08:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:41,381 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 205 transitions. [2018-12-03 18:08:41,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 18:08:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 205 transitions. [2018-12-03 18:08:41,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 18:08:41,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:41,383 INFO L402 BasicCegarLoop]: trace histogram [83, 50, 33, 1, 1, 1] [2018-12-03 18:08:41,383 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:41,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:41,383 INFO L82 PathProgramCache]: Analyzing trace with hash 191369819, now seen corresponding path program 55 times [2018-12-03 18:08:41,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:41,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:41,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:41,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:41,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3408 proven. 1225 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:08:42,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:42,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:42,025 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:42,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:42,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:42,026 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 18:08:42,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:08:42,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:08:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:42,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:43,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:43,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:44,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:44,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 85, 85] total 102 [2018-12-03 18:08:44,956 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:44,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 18:08:44,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 18:08:44,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:08:44,958 INFO L87 Difference]: Start difference. First operand 172 states and 205 transitions. Second operand 88 states. [2018-12-03 18:08:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:45,592 INFO L93 Difference]: Finished difference Result 183 states and 222 transitions. [2018-12-03 18:08:45,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 18:08:45,592 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 169 [2018-12-03 18:08:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:45,593 INFO L225 Difference]: With dead ends: 183 [2018-12-03 18:08:45,593 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 18:08:45,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 204 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13477 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:08:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 18:08:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-12-03 18:08:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 18:08:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 214 transitions. [2018-12-03 18:08:45,604 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 214 transitions. Word has length 169 [2018-12-03 18:08:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:45,604 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 214 transitions. [2018-12-03 18:08:45,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 18:08:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 214 transitions. [2018-12-03 18:08:45,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 18:08:45,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:45,605 INFO L402 BasicCegarLoop]: trace histogram [86, 50, 36, 1, 1, 1] [2018-12-03 18:08:45,605 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:45,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:45,606 INFO L82 PathProgramCache]: Analyzing trace with hash -803505942, now seen corresponding path program 56 times [2018-12-03 18:08:45,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:45,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:45,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:08:45,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:45,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3696 proven. 1444 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:08:46,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:46,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:46,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:46,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:46,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:46,288 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 18:08:46,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:08:46,300 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:08:46,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2018-12-03 18:08:46,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:46,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:08:46,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:08:47,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:47,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39, 39] total 52 [2018-12-03 18:08:47,691 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:47,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 18:08:47,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 18:08:47,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:47,692 INFO L87 Difference]: Start difference. First operand 178 states and 214 transitions. Second operand 41 states. [2018-12-03 18:08:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:47,895 INFO L93 Difference]: Finished difference Result 189 states and 231 transitions. [2018-12-03 18:08:47,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:08:47,896 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 175 [2018-12-03 18:08:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:47,897 INFO L225 Difference]: With dead ends: 189 [2018-12-03 18:08:47,897 INFO L226 Difference]: Without dead ends: 185 [2018-12-03 18:08:47,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 313 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:47,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-03 18:08:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2018-12-03 18:08:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 18:08:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 223 transitions. [2018-12-03 18:08:47,905 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 223 transitions. Word has length 175 [2018-12-03 18:08:47,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:47,905 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 223 transitions. [2018-12-03 18:08:47,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 18:08:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 223 transitions. [2018-12-03 18:08:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 18:08:47,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:47,906 INFO L402 BasicCegarLoop]: trace histogram [89, 50, 39, 1, 1, 1] [2018-12-03 18:08:47,906 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:47,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:47,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1254455353, now seen corresponding path program 57 times [2018-12-03 18:08:47,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:47,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:47,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:47,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:47,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3984 proven. 1681 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:08:48,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:48,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:48,637 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:48,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:48,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:48,638 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 18:08:48,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:08:48,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:08:48,704 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:08:48,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:48,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:49,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:51,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:51,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 91, 91] total 102 [2018-12-03 18:08:51,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:51,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 18:08:51,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 18:08:51,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:08:51,744 INFO L87 Difference]: Start difference. First operand 184 states and 223 transitions. Second operand 94 states. [2018-12-03 18:08:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:52,503 INFO L93 Difference]: Finished difference Result 195 states and 240 transitions. [2018-12-03 18:08:52,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 18:08:52,504 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 181 [2018-12-03 18:08:52,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:52,505 INFO L225 Difference]: With dead ends: 195 [2018-12-03 18:08:52,505 INFO L226 Difference]: Without dead ends: 191 [2018-12-03 18:08:52,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 222 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14947 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:08:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-03 18:08:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2018-12-03 18:08:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 18:08:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 232 transitions. [2018-12-03 18:08:52,513 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 232 transitions. Word has length 181 [2018-12-03 18:08:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:52,513 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 232 transitions. [2018-12-03 18:08:52,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 18:08:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 232 transitions. [2018-12-03 18:08:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 18:08:52,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:52,514 INFO L402 BasicCegarLoop]: trace histogram [92, 50, 42, 1, 1, 1] [2018-12-03 18:08:52,514 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:52,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:52,515 INFO L82 PathProgramCache]: Analyzing trace with hash 180387912, now seen corresponding path program 58 times [2018-12-03 18:08:52,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:52,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:52,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:52,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:52,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4272 proven. 1936 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:08:53,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:53,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:53,350 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:53,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:53,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:53,350 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 18:08:53,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:08:53,361 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:08:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:53,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:54,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:56,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:56,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 94, 94] total 102 [2018-12-03 18:08:56,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:56,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 18:08:56,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 18:08:56,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:08:56,403 INFO L87 Difference]: Start difference. First operand 190 states and 232 transitions. Second operand 97 states. [2018-12-03 18:08:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:57,333 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2018-12-03 18:08:57,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 18:08:57,334 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 187 [2018-12-03 18:08:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:57,335 INFO L225 Difference]: With dead ends: 201 [2018-12-03 18:08:57,335 INFO L226 Difference]: Without dead ends: 197 [2018-12-03 18:08:57,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 231 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15682 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:08:57,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-03 18:08:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-12-03 18:08:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 18:08:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 241 transitions. [2018-12-03 18:08:57,343 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 241 transitions. Word has length 187 [2018-12-03 18:08:57,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:57,344 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 241 transitions. [2018-12-03 18:08:57,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 18:08:57,344 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 241 transitions. [2018-12-03 18:08:57,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 18:08:57,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:57,345 INFO L402 BasicCegarLoop]: trace histogram [95, 50, 45, 1, 1, 1] [2018-12-03 18:08:57,345 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:57,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:57,346 INFO L82 PathProgramCache]: Analyzing trace with hash -304938729, now seen corresponding path program 59 times [2018-12-03 18:08:57,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:57,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:57,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:08:57,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:57,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 2209 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:08:58,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:58,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:58,332 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:58,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:58,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:58,332 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 18:08:58,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:08:58,342 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:08:58,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 92 check-sat command(s) [2018-12-03 18:08:58,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:58,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:08:58,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:08:59,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:59,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48, 48] total 52 [2018-12-03 18:08:59,443 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:59,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 18:08:59,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 18:08:59,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:59,445 INFO L87 Difference]: Start difference. First operand 196 states and 241 transitions. Second operand 50 states. [2018-12-03 18:08:59,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:59,830 INFO L93 Difference]: Finished difference Result 207 states and 258 transitions. [2018-12-03 18:08:59,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 18:08:59,830 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 193 [2018-12-03 18:08:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:59,831 INFO L225 Difference]: With dead ends: 207 [2018-12-03 18:08:59,831 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 18:08:59,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 340 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:08:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 18:08:59,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-12-03 18:08:59,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 18:08:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 250 transitions. [2018-12-03 18:08:59,843 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 250 transitions. Word has length 193 [2018-12-03 18:08:59,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:59,844 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 250 transitions. [2018-12-03 18:08:59,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 18:08:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 250 transitions. [2018-12-03 18:08:59,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 18:08:59,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:59,845 INFO L402 BasicCegarLoop]: trace histogram [98, 50, 48, 1, 1, 1] [2018-12-03 18:08:59,845 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:59,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:59,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1624282458, now seen corresponding path program 60 times [2018-12-03 18:08:59,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:59,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:59,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:59,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:59,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:09:01,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4850 proven. 2304 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:09:01,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:09:01,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:09:01,060 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:09:01,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:09:01,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:09:01,060 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 18:09:01,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:09:01,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:09:01,133 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:09:01,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:09:01,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:09:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:09:02,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:09:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:09:04,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:09:04,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 100, 100] total 102 [2018-12-03 18:09:04,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:09:04,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 18:09:04,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 18:09:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:09:04,077 INFO L87 Difference]: Start difference. First operand 202 states and 250 transitions. Second operand 101 states. [2018-12-03 18:09:04,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:09:04,987 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2018-12-03 18:09:04,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 18:09:04,988 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2018-12-03 18:09:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:09:04,989 INFO L225 Difference]: With dead ends: 209 [2018-12-03 18:09:04,989 INFO L226 Difference]: Without dead ends: 205 [2018-12-03 18:09:04,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 249 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16953 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:09:04,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-03 18:09:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-12-03 18:09:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-03 18:09:05,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 253 transitions. [2018-12-03 18:09:05,000 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 253 transitions. Word has length 199 [2018-12-03 18:09:05,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:09:05,000 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 253 transitions. [2018-12-03 18:09:05,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 18:09:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 253 transitions. [2018-12-03 18:09:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-03 18:09:05,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:09:05,002 INFO L402 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1] [2018-12-03 18:09:05,002 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:09:05,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:09:05,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1862555477, now seen corresponding path program 61 times [2018-12-03 18:09:05,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:09:05,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:09:05,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:09:05,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:09:05,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:09:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:09:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:09:06,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:09:06,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:09:06,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:09:06,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:09:06,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:09:06,006 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 18:09:06,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:09:06,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:09:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:09:06,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:09:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:09:07,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:09:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:09:09,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:09:09,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 101, 101] total 102 [2018-12-03 18:09:09,753 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:09:09,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 18:09:09,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 18:09:09,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:09:09,755 INFO L87 Difference]: Start difference. First operand 204 states and 253 transitions. Second operand 102 states. [2018-12-03 18:09:10,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:09:10,823 INFO L93 Difference]: Finished difference Result 210 states and 260 transitions. [2018-12-03 18:09:10,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 18:09:10,823 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2018-12-03 18:09:10,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:09:10,824 INFO L225 Difference]: With dead ends: 210 [2018-12-03 18:09:10,825 INFO L226 Difference]: Without dead ends: 206 [2018-12-03 18:09:10,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 252 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17200 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:09:10,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-03 18:09:10,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-12-03 18:09:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-03 18:09:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 256 transitions. [2018-12-03 18:09:10,833 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 256 transitions. Word has length 201 [2018-12-03 18:09:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:09:10,833 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 256 transitions. [2018-12-03 18:09:10,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 18:09:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 256 transitions. [2018-12-03 18:09:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-03 18:09:10,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:09:10,834 INFO L402 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1] [2018-12-03 18:09:10,834 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:09:10,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:09:10,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1085307248, now seen corresponding path program 62 times [2018-12-03 18:09:10,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:09:10,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:09:10,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:09:10,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:09:10,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:09:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:09:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 7450 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 18:09:12,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:09:12,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2018-12-03 18:09:12,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:09:12,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 18:09:12,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 18:09:12,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 18:09:12,040 INFO L87 Difference]: Start difference. First operand 206 states and 256 transitions. Second operand 53 states. [2018-12-03 18:09:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:09:12,228 INFO L93 Difference]: Finished difference Result 2756 states and 4081 transitions. [2018-12-03 18:09:12,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 18:09:12,228 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 203 [2018-12-03 18:09:12,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:09:12,238 INFO L225 Difference]: With dead ends: 2756 [2018-12-03 18:09:12,238 INFO L226 Difference]: Without dead ends: 2755 [2018-12-03 18:09:12,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 18:09:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2018-12-03 18:09:12,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 205. [2018-12-03 18:09:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-03 18:09:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 255 transitions. [2018-12-03 18:09:12,302 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 255 transitions. Word has length 203 [2018-12-03 18:09:12,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:09:12,302 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 255 transitions. [2018-12-03 18:09:12,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 18:09:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 255 transitions. [2018-12-03 18:09:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 18:09:12,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:09:12,304 INFO L402 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1, 1] [2018-12-03 18:09:12,304 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:09:12,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:09:12,304 INFO L82 PathProgramCache]: Analyzing trace with hash -715213634, now seen corresponding path program 1 times [2018-12-03 18:09:12,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:09:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:09:12,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:09:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:09:12,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:09:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:09:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 18:09:13,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:09:13,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:09:13,462 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-12-03 18:09:13,462 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [14], [15] [2018-12-03 18:09:13,463 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:09:13,463 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:09:13,534 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:09:13,534 INFO L272 AbstractInterpreter]: Visited 7 different actions 49 times. Merged at 5 different actions 22 times. Widened at 2 different actions 6 times. Found 4 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:09:13,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:09:13,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:09:13,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:09:13,566 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 18:09:13,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:09:13,575 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:09:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:09:13,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:09:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 18:09:13,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:09:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 18:09:14,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:09:14,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 18:09:14,673 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:09:14,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 18:09:14,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 18:09:14,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 18:09:14,674 INFO L87 Difference]: Start difference. First operand 205 states and 255 transitions. Second operand 53 states. [2018-12-03 18:09:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:09:15,621 INFO L93 Difference]: Finished difference Result 2859 states and 4234 transitions. [2018-12-03 18:09:15,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 18:09:15,622 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 204 [2018-12-03 18:09:15,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:09:15,636 INFO L225 Difference]: With dead ends: 2859 [2018-12-03 18:09:15,636 INFO L226 Difference]: Without dead ends: 2856 [2018-12-03 18:09:15,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 356 SyntacticMatches, 50 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 18:09:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2018-12-03 18:09:15,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 207. [2018-12-03 18:09:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 18:09:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 258 transitions. [2018-12-03 18:09:15,736 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 258 transitions. Word has length 204 [2018-12-03 18:09:15,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:09:15,736 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 258 transitions. [2018-12-03 18:09:15,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 18:09:15,736 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 258 transitions. [2018-12-03 18:09:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-03 18:09:15,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:09:15,738 INFO L402 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1] [2018-12-03 18:09:15,738 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:09:15,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:09:15,738 INFO L82 PathProgramCache]: Analyzing trace with hash -133074471, now seen corresponding path program 2 times [2018-12-03 18:09:15,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:09:15,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:09:15,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:09:15,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:09:15,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:09:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:09:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 18:09:17,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:09:17,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-12-03 18:09:17,119 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:09:17,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 18:09:17,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 18:09:17,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:09:17,120 INFO L87 Difference]: Start difference. First operand 207 states and 258 transitions. Second operand 52 states. [2018-12-03 18:09:17,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:09:17,688 INFO L93 Difference]: Finished difference Result 306 states and 406 transitions. [2018-12-03 18:09:17,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 18:09:17,688 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 206 [2018-12-03 18:09:17,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:09:17,689 INFO L225 Difference]: With dead ends: 306 [2018-12-03 18:09:17,689 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 18:09:17,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:09:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 18:09:17,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 18:09:17,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 18:09:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 18:09:17,693 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2018-12-03 18:09:17,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:09:17,693 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 18:09:17,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 18:09:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 18:09:17,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 18:09:17,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 18:09:37,164 WARN L180 SmtUtils]: Spent 19.45 s on a formula simplification. DAG size of input: 3222 DAG size of output: 3056 [2018-12-03 18:10:39,255 WARN L180 SmtUtils]: Spent 1.03 m on a formula simplification. DAG size of input: 3056 DAG size of output: 407 [2018-12-03 18:10:39,260 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 11 26) no Hoare annotation was computed. [2018-12-03 18:10:39,260 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONASSERT(line 25) no Hoare annotation was computed. [2018-12-03 18:10:39,260 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-03 18:10:39,260 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 26) no Hoare annotation was computed. [2018-12-03 18:10:39,260 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-12-03 18:10:39,260 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 21) no Hoare annotation was computed. [2018-12-03 18:10:39,260 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 24) no Hoare annotation was computed. [2018-12-03 18:10:39,262 INFO L444 ceAbstractionStarter]: At program point L16-2(lines 15 22) the Hoare annotation is: (or (and (<= 83 x) (and (<= y 83) (and (<= x 83) (<= 83 y)))) (and (and (and (<= x 71) (<= 71 y)) (<= y 71)) (<= 71 x)) (and (and (<= y 75) (and (<= x 75) (<= 75 y))) (<= 75 x)) (and (<= 68 x) (and (and (<= 68 y) (<= x 68)) (<= y 68))) (and (<= 82 x) (and (and (<= x 82) (<= 82 y)) (<= y 82))) (and (<= 92 x) (and (<= y 92) (and (<= 92 y) (<= x 92)))) (and (<= 88 x) (and (and (<= x 88) (<= 88 y)) (<= y 88))) (and (<= 51 x) (and (and (<= x 51) (<= 51 y)) (<= y 51))) (and (<= 57 x) (and (and (<= x 57) (<= 57 y)) (<= y 57))) (and (and (<= y 58) (and (<= 58 y) (<= x 58))) (<= 58 x)) (and (and (<= y 91) (and (<= 91 y) (<= x 91))) (<= 91 x)) (and (<= 74 x) (and (and (<= x 74) (<= 74 y)) (<= y 74))) (and (and (and (<= x 72) (<= 72 y)) (<= y 72)) (<= 72 x)) (and (<= 87 x) (and (<= y 87) (and (<= 87 y) (<= x 87)))) (and (and (and (<= 60 y) (<= x 60)) (<= y 60)) (<= 60 x)) (and (and (and (<= x 76) (<= 76 y)) (<= y 76)) (<= 76 x)) (and (<= 56 x) (and (and (<= x 56) (<= 56 y)) (<= y 56))) (and (<= 100 x) (and (<= 100 y) (<= y 100))) (and (<= 53 x) (and (and (<= 53 y) (<= x 53)) (<= y 53))) (and (<= 86 x) (and (<= y 86) (and (<= 86 y) (<= x 86)))) (and (and (<= y 79) (and (<= 79 y) (<= x 79))) (<= 79 x)) (and (and (and (<= 99 y) (<= x 99)) (<= y 99)) (<= 99 x)) (and (and (<= y 78) (and (<= 78 y) (<= x 78))) (<= 78 x)) (and (and (<= y 63) (and (<= 63 y) (<= x 63))) (<= 63 x)) (and (and (and (<= x 94) (<= 94 y)) (<= y 94)) (<= 94 x)) (and (and (<= y 55) (and (<= x 55) (<= 55 y))) (<= 55 x)) (and (<= 70 x) (and (and (<= 70 y) (<= x 70)) (<= y 70))) (and (<= 85 x) (and (<= y 85) (and (<= 85 y) (<= x 85)))) (and (<= 54 x) (and (and (<= x 54) (<= 54 y)) (<= y 54))) (and (and (and (<= x 89) (<= 89 y)) (<= y 89)) (<= 89 x)) (and (and (and (<= 69 y) (<= x 69)) (<= y 69)) (<= 69 x)) (and (<= 64 x) (and (<= y 64) (and (<= 64 y) (<= x 64)))) (and (and (and (<= x 59) (<= 59 y)) (<= y 59)) (<= 59 x)) (and (and (and (<= 97 y) (<= x 97)) (<= y 97)) (<= 97 x)) (and (<= 52 x) (and (and (<= 52 y) (<= x 52)) (<= y 52))) (and (<= 61 x) (and (<= y 61) (and (<= 61 y) (<= x 61)))) (and (<= 84 x) (and (and (<= x 84) (<= 84 y)) (<= y 84))) (and (<= 80 x) (and (<= y 80) (and (<= x 80) (<= 80 y)))) (and (<= 95 x) (and (<= y 95) (and (<= x 95) (<= 95 y)))) (and (and (<= y 65) (and (<= 65 y) (<= x 65))) (<= 65 x)) (and (and (<= y 77) (and (<= 77 y) (<= x 77))) (<= 77 x)) (and (and (<= y 90) (and (<= x 90) (<= 90 y))) (<= 90 x)) (and (<= 73 x) (and (<= y 73) (and (<= x 73) (<= 73 y)))) (and (and (and (<= x 93) (<= 93 y)) (<= y 93)) (<= 93 x)) (and (and (<= y 81) (and (<= x 81) (<= 81 y))) (<= 81 x)) (and (<= y 50) (and (<= 50 y) (<= x 50))) (and (and (and (<= 67 y) (<= x 67)) (<= y 67)) (<= 67 x)) (and (<= 62 x) (and (<= y 62) (and (<= 62 y) (<= x 62)))) (and (<= 98 x) (and (<= y 98) (and (<= x 98) (<= 98 y)))) (and (<= 96 x) (and (<= y 96) (and (<= 96 y) (<= x 96)))) (and (and (and (<= x 66) (<= 66 y)) (<= y 66)) (<= 66 x))) [2018-12-03 18:10:39,262 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 26) no Hoare annotation was computed. [2018-12-03 18:10:39,280 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:10:39 BoogieIcfgContainer [2018-12-03 18:10:39,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 18:10:39,282 INFO L168 Benchmark]: Toolchain (without parser) took 220686.47 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-12-03 18:10:39,283 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:10:39,283 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:10:39,283 INFO L168 Benchmark]: Boogie Preprocessor took 25.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:10:39,284 INFO L168 Benchmark]: RCFGBuilder took 370.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 18:10:39,284 INFO L168 Benchmark]: TraceAbstraction took 220244.55 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-12-03 18:10:39,286 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 370.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 220244.55 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 24]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((83 <= x && y <= 83 && x <= 83 && 83 <= y) || (((x <= 71 && 71 <= y) && y <= 71) && 71 <= x)) || ((y <= 75 && x <= 75 && 75 <= y) && 75 <= x)) || (68 <= x && (68 <= y && x <= 68) && y <= 68)) || (82 <= x && (x <= 82 && 82 <= y) && y <= 82)) || (92 <= x && y <= 92 && 92 <= y && x <= 92)) || (88 <= x && (x <= 88 && 88 <= y) && y <= 88)) || (51 <= x && (x <= 51 && 51 <= y) && y <= 51)) || (57 <= x && (x <= 57 && 57 <= y) && y <= 57)) || ((y <= 58 && 58 <= y && x <= 58) && 58 <= x)) || ((y <= 91 && 91 <= y && x <= 91) && 91 <= x)) || (74 <= x && (x <= 74 && 74 <= y) && y <= 74)) || (((x <= 72 && 72 <= y) && y <= 72) && 72 <= x)) || (87 <= x && y <= 87 && 87 <= y && x <= 87)) || (((60 <= y && x <= 60) && y <= 60) && 60 <= x)) || (((x <= 76 && 76 <= y) && y <= 76) && 76 <= x)) || (56 <= x && (x <= 56 && 56 <= y) && y <= 56)) || (100 <= x && 100 <= y && y <= 100)) || (53 <= x && (53 <= y && x <= 53) && y <= 53)) || (86 <= x && y <= 86 && 86 <= y && x <= 86)) || ((y <= 79 && 79 <= y && x <= 79) && 79 <= x)) || (((99 <= y && x <= 99) && y <= 99) && 99 <= x)) || ((y <= 78 && 78 <= y && x <= 78) && 78 <= x)) || ((y <= 63 && 63 <= y && x <= 63) && 63 <= x)) || (((x <= 94 && 94 <= y) && y <= 94) && 94 <= x)) || ((y <= 55 && x <= 55 && 55 <= y) && 55 <= x)) || (70 <= x && (70 <= y && x <= 70) && y <= 70)) || (85 <= x && y <= 85 && 85 <= y && x <= 85)) || (54 <= x && (x <= 54 && 54 <= y) && y <= 54)) || (((x <= 89 && 89 <= y) && y <= 89) && 89 <= x)) || (((69 <= y && x <= 69) && y <= 69) && 69 <= x)) || (64 <= x && y <= 64 && 64 <= y && x <= 64)) || (((x <= 59 && 59 <= y) && y <= 59) && 59 <= x)) || (((97 <= y && x <= 97) && y <= 97) && 97 <= x)) || (52 <= x && (52 <= y && x <= 52) && y <= 52)) || (61 <= x && y <= 61 && 61 <= y && x <= 61)) || (84 <= x && (x <= 84 && 84 <= y) && y <= 84)) || (80 <= x && y <= 80 && x <= 80 && 80 <= y)) || (95 <= x && y <= 95 && x <= 95 && 95 <= y)) || ((y <= 65 && 65 <= y && x <= 65) && 65 <= x)) || ((y <= 77 && 77 <= y && x <= 77) && 77 <= x)) || ((y <= 90 && x <= 90 && 90 <= y) && 90 <= x)) || (73 <= x && y <= 73 && x <= 73 && 73 <= y)) || (((x <= 93 && 93 <= y) && y <= 93) && 93 <= x)) || ((y <= 81 && x <= 81 && 81 <= y) && 81 <= x)) || (y <= 50 && 50 <= y && x <= 50)) || (((67 <= y && x <= 67) && y <= 67) && 67 <= x)) || (62 <= x && y <= 62 && 62 <= y && x <= 62)) || (98 <= x && y <= 98 && x <= 98 && 98 <= y)) || (96 <= x && y <= 96 && 96 <= y && x <= 96)) || (((x <= 66 && 66 <= y) && y <= 66) && 66 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 2 error locations. SAFE Result, 220.1s OverallTime, 66 OverallIterations, 101 TraceHistogramMax, 20.0s AutomataDifference, 0.0s DeadEndRemovalTime, 81.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 464 SDtfs, 1663 SDslu, 3677 SDs, 0 SdLazy, 7427 SolverSat, 2452 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 13501 GetRequests, 9153 SyntacticMatches, 1178 SemanticMatches, 3170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126943 ImplicationChecksByTransitivity, 107.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 66 MinimizatonAttempts, 5228 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 758 HoareAnnotationTreeSize, 1 FomulaSimplifications, 133043 FormulaSimplificationTreeSizeReduction, 19.4s HoareSimplificationTime, 1 FomulaSimplificationsInter, 334056 FormulaSimplificationTreeSizeReductionInter, 62.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 111.2s InterpolantComputationTime, 12091 NumberOfCodeBlocks, 11501 NumberOfCodeBlocksAsserted, 722 NumberOfCheckSat, 17738 ConstructedInterpolants, 0 QuantifiedInterpolants, 5296172 SizeOfPredicates, 48 NumberOfNonLiveVariables, 12517 ConjunctsInSsa, 1991 ConjunctsInUnsatCore, 190 InterpolantComputations, 3 PerfectInterpolantSequences, 272904/542271 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...