java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-ArraysIntegefied.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:52:00,563 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:52:00,565 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:52:00,577 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:52:00,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:52:00,578 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:52:00,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:52:00,581 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:52:00,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:52:00,584 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:52:00,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:52:00,585 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:52:00,586 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:52:00,587 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:52:00,588 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:52:00,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:52:00,590 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:52:00,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:52:00,594 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:52:00,595 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:52:00,596 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:52:00,597 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:52:00,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:52:00,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:52:00,601 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:52:00,601 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:52:00,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:52:00,603 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:52:00,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:52:00,605 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:52:00,606 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:52:00,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:52:00,606 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:52:00,607 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:52:00,608 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:52:00,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:52:00,609 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:52:00,621 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:52:00,622 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:52:00,622 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:52:00,623 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:52:00,623 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:52:00,623 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:52:00,623 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:52:00,623 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:52:00,624 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:52:00,624 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:52:00,624 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:52:00,624 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:52:00,624 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:52:00,625 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:52:00,625 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:52:00,625 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:52:00,626 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:52:00,626 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:52:00,626 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:52:00,626 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:52:00,626 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:52:00,627 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:52:00,627 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:52:00,627 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:52:00,627 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:52:00,627 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:52:00,628 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:52:00,628 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:52:00,628 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:52:00,628 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:52:00,628 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:52:00,629 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:52:00,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:52:00,629 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:52:00,629 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:52:00,629 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:52:00,630 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:52:00,630 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:52:00,630 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:52:00,630 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:52:00,630 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:52:00,664 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:52:00,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:52:00,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:52:00,686 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:52:00,686 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:52:00,687 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-ArraysIntegefied.bpl [2018-12-03 16:52:00,688 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-ArraysIntegefied.bpl' [2018-12-03 16:52:00,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:52:00,732 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:52:00,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:52:00,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:52:00,733 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:52:00,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:52:00" (1/1) ... [2018-12-03 16:52:00,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:52:00" (1/1) ... [2018-12-03 16:52:00,768 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:52:00,769 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:52:00,769 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:52:00,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:52:00,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:52:00,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:52:00,773 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:52:00,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:52:00" (1/1) ... [2018-12-03 16:52:00,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:52:00" (1/1) ... [2018-12-03 16:52:00,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:52:00" (1/1) ... [2018-12-03 16:52:00,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:52:00" (1/1) ... [2018-12-03 16:52:00,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:52:00" (1/1) ... [2018-12-03 16:52:00,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:52:00" (1/1) ... [2018-12-03 16:52:00,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:52:00" (1/1) ... [2018-12-03 16:52:00,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:52:00,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:52:00,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:52:00,800 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:52:00,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:52:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:52:00,873 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 16:52:00,874 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 16:52:00,874 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 16:52:01,223 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:52:01,224 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:52:01,224 INFO L202 PluginConnector]: Adding new model Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:52:01 BoogieIcfgContainer [2018-12-03 16:52:01,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:52:01,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:52:01,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:52:01,229 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:52:01,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:52:00" (1/2) ... [2018-12-03 16:52:01,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ad7e7e and model type Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:52:01, skipping insertion in model container [2018-12-03 16:52:01,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:52:01" (2/2) ... [2018-12-03 16:52:01,232 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-ArraysIntegefied.bpl [2018-12-03 16:52:01,242 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:52:01,251 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:52:01,271 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:52:01,306 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:52:01,307 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:52:01,307 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:52:01,307 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:52:01,307 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:52:01,308 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:52:01,308 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:52:01,308 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:52:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2018-12-03 16:52:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:52:01,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:01,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 16:52:01,335 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:01,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:01,342 INFO L82 PathProgramCache]: Analyzing trace with hash 890493448, now seen corresponding path program 1 times [2018-12-03 16:52:01,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:01,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:01,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:01,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:01,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:01,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:52:01,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:52:01,544 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:52:01,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:52:01,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:52:01,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:52:01,591 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2018-12-03 16:52:01,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:01,679 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2018-12-03 16:52:01,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:52:01,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-12-03 16:52:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:01,711 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:52:01,711 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:52:01,718 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 16:52:01,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:52:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:52:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:52:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 16:52:01,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2018-12-03 16:52:01,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:01,752 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 16:52:01,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:52:01,752 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 16:52:01,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:52:01,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:01,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 16:52:01,753 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:01,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:01,754 INFO L82 PathProgramCache]: Analyzing trace with hash 892342412, now seen corresponding path program 1 times [2018-12-03 16:52:01,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:01,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:01,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:01,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:01,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:01,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:52:01,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:52:01,797 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:52:01,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:52:01,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:52:01,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:52:01,800 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 3 states. [2018-12-03 16:52:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:01,849 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 16:52:01,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:52:01,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-12-03 16:52:01,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:01,851 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:52:01,851 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:52:01,852 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 16:52:01,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:52:01,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 16:52:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:52:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 16:52:01,855 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 6 [2018-12-03 16:52:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:01,855 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 16:52:01,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:52:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 16:52:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:52:01,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:01,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:01,857 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:01,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:01,857 INFO L82 PathProgramCache]: Analyzing trace with hash -391235530, now seen corresponding path program 1 times [2018-12-03 16:52:01,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:01,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:01,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:01,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:01,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:01,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:01,910 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 16:52:01,911 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [12], [16], [21], [23], [28], [33], [34] [2018-12-03 16:52:01,952 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:52:01,952 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:52:02,160 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:52:02,163 INFO L272 AbstractInterpreter]: Visited 10 different actions 25 times. Merged at 5 different actions 12 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:52:02,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:02,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:52:02,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:02,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:02,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:02,201 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:02,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:02,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:02,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:02,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:52:02,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:02,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:52:02,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:52:02,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:52:02,561 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 4 states. [2018-12-03 16:52:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:02,640 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 16:52:02,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:52:02,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-03 16:52:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:02,643 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:52:02,643 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:52:02,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:52:02,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:52:02,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 16:52:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:52:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 16:52:02,652 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2018-12-03 16:52:02,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:02,653 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 16:52:02,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:52:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 16:52:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:52:02,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:02,655 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:02,656 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:02,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:02,657 INFO L82 PathProgramCache]: Analyzing trace with hash -602113312, now seen corresponding path program 2 times [2018-12-03 16:52:02,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:02,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:02,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:02,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:02,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:02,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:02,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:02,829 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:02,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:02,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:02,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:02,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:02,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:02,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:52:02,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:02,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:02,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:03,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:03,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:52:03,007 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:03,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:52:03,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:52:03,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:52:03,008 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-12-03 16:52:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:03,101 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 16:52:03,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:52:03,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-03 16:52:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:03,102 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:52:03,102 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:52:03,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:52:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:52:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 16:52:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:52:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 16:52:03,107 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2018-12-03 16:52:03,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:03,107 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 16:52:03,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:52:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 16:52:03,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:52:03,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:03,109 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:03,109 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:03,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:03,110 INFO L82 PathProgramCache]: Analyzing trace with hash 334846090, now seen corresponding path program 3 times [2018-12-03 16:52:03,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:03,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:03,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:03,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:03,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:03,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:03,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:03,371 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:03,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:03,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:03,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:03,383 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:03,383 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:03,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:03,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:03,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:03,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:03,561 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:03,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:03,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:52:03,581 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:03,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:52:03,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:52:03,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:52:03,583 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 6 states. [2018-12-03 16:52:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:03,613 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 16:52:03,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:52:03,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-03 16:52:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:03,615 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:52:03,616 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:52:03,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:52:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:52:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 16:52:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 16:52:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 16:52:03,624 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 18 [2018-12-03 16:52:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:03,624 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 16:52:03,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:52:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 16:52:03,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:52:03,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:03,626 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:03,626 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:03,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:03,627 INFO L82 PathProgramCache]: Analyzing trace with hash -747417292, now seen corresponding path program 4 times [2018-12-03 16:52:03,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:03,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:03,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:03,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:03,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:03,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:03,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:03,842 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:03,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:03,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:03,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:03,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:03,865 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:03,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:03,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:04,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:04,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:52:04,018 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:04,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:52:04,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:52:04,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:52:04,019 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 7 states. [2018-12-03 16:52:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:04,040 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 16:52:04,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:52:04,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-03 16:52:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:04,042 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:52:04,042 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:52:04,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:52:04,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:52:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 16:52:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:52:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 16:52:04,048 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2018-12-03 16:52:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:04,048 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 16:52:04,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:52:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 16:52:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:52:04,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:04,050 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:04,050 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:04,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:04,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1016128734, now seen corresponding path program 5 times [2018-12-03 16:52:04,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:04,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:04,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:04,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:04,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:04,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:04,342 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:04,342 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:04,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:04,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:04,343 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:04,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:04,358 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:04,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:52:04,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:04,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:04,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:04,629 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:04,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:04,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:52:04,649 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:04,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:52:04,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:52:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:52:04,650 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 8 states. [2018-12-03 16:52:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:04,700 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 16:52:04,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:52:04,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-03 16:52:04,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:04,702 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:52:04,702 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:52:04,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:52:04,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:52:04,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 16:52:04,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:52:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 16:52:04,707 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 26 [2018-12-03 16:52:04,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:04,708 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 16:52:04,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:52:04,708 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 16:52:04,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:52:04,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:04,709 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:04,709 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:04,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:04,710 INFO L82 PathProgramCache]: Analyzing trace with hash -267873400, now seen corresponding path program 6 times [2018-12-03 16:52:04,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:04,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:04,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:04,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:04,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:04,884 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:04,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:04,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:04,885 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:04,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:04,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:04,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:04,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:04,905 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:04,925 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:04,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:04,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:04,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:05,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:05,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:52:05,159 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:05,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:52:05,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:52:05,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:52:05,161 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 9 states. [2018-12-03 16:52:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:05,202 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 16:52:05,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:52:05,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-12-03 16:52:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:05,203 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:52:05,203 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:52:05,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:52:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:52:05,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 16:52:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:52:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 16:52:05,209 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 30 [2018-12-03 16:52:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:05,209 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 16:52:05,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:52:05,210 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 16:52:05,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:52:05,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:05,211 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:05,211 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:05,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:05,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1386947278, now seen corresponding path program 7 times [2018-12-03 16:52:05,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:05,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:05,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:05,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:05,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:05,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:05,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:05,545 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:05,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:05,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:05,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:05,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:05,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:05,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:05,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:05,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:05,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:52:05,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:05,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:52:05,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:52:05,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:52:05,847 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 10 states. [2018-12-03 16:52:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:05,974 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 16:52:05,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:52:05,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-12-03 16:52:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:05,976 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:52:05,976 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 16:52:05,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:52:05,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 16:52:05,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 16:52:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 16:52:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 16:52:05,981 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 34 [2018-12-03 16:52:05,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:05,981 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 16:52:05,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:52:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 16:52:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:52:05,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:05,983 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:05,983 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:05,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:05,983 INFO L82 PathProgramCache]: Analyzing trace with hash -223329828, now seen corresponding path program 8 times [2018-12-03 16:52:05,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:05,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:05,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:05,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:05,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:06,115 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:06,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:06,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:06,116 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:06,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:06,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:06,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:06,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:06,131 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:06,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 16:52:06,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:06,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:06,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:06,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:06,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:52:06,422 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:06,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:52:06,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:52:06,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:52:06,423 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 11 states. [2018-12-03 16:52:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:06,458 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 16:52:06,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:52:06,460 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-12-03 16:52:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:06,460 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:52:06,461 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 16:52:06,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:52:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 16:52:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 16:52:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 16:52:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 16:52:06,465 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 38 [2018-12-03 16:52:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:06,466 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 16:52:06,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:52:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 16:52:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:52:06,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:06,467 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:06,468 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:06,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:06,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1659551354, now seen corresponding path program 9 times [2018-12-03 16:52:06,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:06,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:06,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:06,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:06,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:06,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:06,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:06,732 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:06,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:06,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:06,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:06,744 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:06,744 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:06,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:06,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:06,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:06,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:07,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:07,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:52:07,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:07,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:52:07,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:52:07,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:52:07,071 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 12 states. [2018-12-03 16:52:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:07,197 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 16:52:07,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:52:07,198 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-12-03 16:52:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:07,199 INFO L225 Difference]: With dead ends: 49 [2018-12-03 16:52:07,201 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 16:52:07,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:52:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 16:52:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 16:52:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 16:52:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 16:52:07,209 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 42 [2018-12-03 16:52:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:07,210 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 16:52:07,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:52:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 16:52:07,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 16:52:07,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:07,211 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:07,211 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:07,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:07,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2009179088, now seen corresponding path program 10 times [2018-12-03 16:52:07,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:07,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:07,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:07,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:07,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:07,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:07,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:07,449 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:07,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:07,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:07,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:07,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:07,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:07,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:07,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:07,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:07,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 16:52:07,742 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:07,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:52:07,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:52:07,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:52:07,743 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 13 states. [2018-12-03 16:52:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:07,795 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 16:52:07,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:52:07,800 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-12-03 16:52:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:07,801 INFO L225 Difference]: With dead ends: 53 [2018-12-03 16:52:07,801 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 16:52:07,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:52:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 16:52:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 16:52:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:52:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 16:52:07,806 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2018-12-03 16:52:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:07,806 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 16:52:07,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:52:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 16:52:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:52:07,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:07,807 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:07,807 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:07,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:07,808 INFO L82 PathProgramCache]: Analyzing trace with hash 782635482, now seen corresponding path program 11 times [2018-12-03 16:52:07,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:07,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:07,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:07,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:07,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:08,091 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:08,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:08,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:08,092 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:08,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:08,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:08,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:08,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:08,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:08,123 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 16:52:08,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:08,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:08,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:08,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:08,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 16:52:08,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:08,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:52:08,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:52:08,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:52:08,530 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 14 states. [2018-12-03 16:52:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:08,565 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 16:52:08,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:52:08,566 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-12-03 16:52:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:08,567 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:52:08,567 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 16:52:08,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:52:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 16:52:08,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 16:52:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 16:52:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 16:52:08,574 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 50 [2018-12-03 16:52:08,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:08,574 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 16:52:08,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:52:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 16:52:08,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:52:08,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:08,575 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:08,575 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:08,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:08,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1233576580, now seen corresponding path program 12 times [2018-12-03 16:52:08,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:08,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:08,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:08,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:08,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:08,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:08,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:08,881 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:08,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:08,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:08,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:08,891 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:08,891 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:08,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:08,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:08,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:08,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:09,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:09,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 16:52:09,474 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:09,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:52:09,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:52:09,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:52:09,476 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 15 states. [2018-12-03 16:52:09,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:09,502 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 16:52:09,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:52:09,503 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-12-03 16:52:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:09,504 INFO L225 Difference]: With dead ends: 61 [2018-12-03 16:52:09,505 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 16:52:09,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:52:09,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 16:52:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 16:52:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:52:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 16:52:09,511 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 54 [2018-12-03 16:52:09,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:09,511 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 16:52:09,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:52:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 16:52:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 16:52:09,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:09,513 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:09,513 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:09,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:09,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1893420590, now seen corresponding path program 13 times [2018-12-03 16:52:09,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:09,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:09,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:09,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:09,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:09,707 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:09,707 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:09,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:09,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:09,707 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:09,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:09,719 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:09,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:09,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:10,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:10,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 16:52:10,245 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:10,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:52:10,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:52:10,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:52:10,246 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 16 states. [2018-12-03 16:52:10,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:10,274 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 16:52:10,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:52:10,274 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-12-03 16:52:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:10,276 INFO L225 Difference]: With dead ends: 65 [2018-12-03 16:52:10,276 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 16:52:10,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:52:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 16:52:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 16:52:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 16:52:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 16:52:10,283 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 58 [2018-12-03 16:52:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:10,283 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 16:52:10,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:52:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 16:52:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 16:52:10,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:10,285 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:10,285 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:10,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:10,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1151478568, now seen corresponding path program 14 times [2018-12-03 16:52:10,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:10,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:10,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:10,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:10,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:11,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:11,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:11,118 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:11,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:11,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:11,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:11,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:11,131 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:11,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 16:52:11,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:11,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:11,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:13,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:13,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 16:52:13,044 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:13,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:52:13,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:52:13,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:52:13,045 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 17 states. [2018-12-03 16:52:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:13,101 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 16:52:13,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:52:13,102 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2018-12-03 16:52:13,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:13,102 INFO L225 Difference]: With dead ends: 69 [2018-12-03 16:52:13,102 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 16:52:13,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:52:13,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 16:52:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 16:52:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 16:52:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 16:52:13,109 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 62 [2018-12-03 16:52:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:13,109 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 16:52:13,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:52:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 16:52:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:52:13,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:13,111 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:13,111 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:13,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:13,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1586034306, now seen corresponding path program 15 times [2018-12-03 16:52:13,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:13,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:13,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:13,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:13,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:13,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:13,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:13,496 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:13,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:13,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:13,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:13,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:13,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:13,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:13,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:13,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:13,555 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:13,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:14,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:14,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 16:52:14,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:14,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:52:14,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:52:14,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:52:14,145 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 18 states. [2018-12-03 16:52:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:14,178 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 16:52:14,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:52:14,179 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-12-03 16:52:14,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:14,179 INFO L225 Difference]: With dead ends: 73 [2018-12-03 16:52:14,180 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 16:52:14,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:52:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 16:52:14,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 16:52:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 16:52:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 16:52:14,186 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 66 [2018-12-03 16:52:14,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:14,187 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 16:52:14,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:52:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 16:52:14,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 16:52:14,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:14,188 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:14,188 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:14,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:14,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1318531884, now seen corresponding path program 16 times [2018-12-03 16:52:14,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:14,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:14,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:14,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:14,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:14,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:14,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:14,896 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:14,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 16:52:14,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:14,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:14,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:14,905 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:14,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:14,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:15,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:15,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 16:52:15,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:15,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:52:15,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:52:15,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:52:15,873 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 19 states. [2018-12-03 16:52:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:16,106 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 16:52:16,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:52:16,106 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-12-03 16:52:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:16,107 INFO L225 Difference]: With dead ends: 77 [2018-12-03 16:52:16,107 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 16:52:16,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:52:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 16:52:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 16:52:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 16:52:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 16:52:16,112 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 70 [2018-12-03 16:52:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:16,112 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 16:52:16,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:52:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 16:52:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 16:52:16,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:16,113 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:16,114 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:16,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:16,114 INFO L82 PathProgramCache]: Analyzing trace with hash -561837354, now seen corresponding path program 17 times [2018-12-03 16:52:16,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:16,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:16,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:16,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:16,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:16,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:16,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:16,337 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:16,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:16,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:16,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:16,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:16,346 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:16,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 16:52:16,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:16,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:16,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:17,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:17,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 16:52:17,289 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:17,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:52:17,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:52:17,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:52:17,291 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 20 states. [2018-12-03 16:52:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:17,354 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 16:52:17,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:52:17,354 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-12-03 16:52:17,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:17,354 INFO L225 Difference]: With dead ends: 81 [2018-12-03 16:52:17,355 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 16:52:17,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:52:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 16:52:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 16:52:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 16:52:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 16:52:17,360 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 74 [2018-12-03 16:52:17,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:17,360 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 16:52:17,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:52:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 16:52:17,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 16:52:17,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:17,362 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:17,362 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:17,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:17,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1611070848, now seen corresponding path program 18 times [2018-12-03 16:52:17,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:17,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:17,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:17,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:17,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:18,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:18,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:18,108 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:18,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:18,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:18,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:18,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:18,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:18,134 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:18,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:18,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:18,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:18,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:18,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 16:52:18,850 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:18,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:52:18,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:52:18,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:52:18,851 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 21 states. [2018-12-03 16:52:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:18,886 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 16:52:18,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:52:18,886 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-12-03 16:52:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:18,888 INFO L225 Difference]: With dead ends: 85 [2018-12-03 16:52:18,888 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 16:52:18,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:52:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 16:52:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 16:52:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 16:52:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 16:52:18,893 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 78 [2018-12-03 16:52:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:18,894 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 16:52:18,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:52:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 16:52:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 16:52:18,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:18,895 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:18,895 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:18,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:18,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1013085398, now seen corresponding path program 19 times [2018-12-03 16:52:18,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:18,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:18,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:18,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:18,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:19,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:19,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:19,246 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:19,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:19,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:19,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:19,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:19,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:19,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:19,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:19,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:19,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 16:52:19,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:19,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:52:19,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:52:19,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:52:19,819 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 22 states. [2018-12-03 16:52:19,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:19,859 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 16:52:19,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:52:19,860 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 82 [2018-12-03 16:52:19,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:19,861 INFO L225 Difference]: With dead ends: 89 [2018-12-03 16:52:19,861 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 16:52:19,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:52:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 16:52:19,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 16:52:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 16:52:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 16:52:19,865 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 82 [2018-12-03 16:52:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:19,866 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 16:52:19,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:52:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 16:52:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 16:52:19,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:19,867 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:19,867 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:19,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:19,868 INFO L82 PathProgramCache]: Analyzing trace with hash 947991508, now seen corresponding path program 20 times [2018-12-03 16:52:19,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:19,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:19,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:19,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:19,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:20,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:20,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:20,165 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:20,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:20,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:20,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:20,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:20,174 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:20,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 16:52:20,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:20,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:20,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:20,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:20,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 16:52:20,756 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:20,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:52:20,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:52:20,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:52:20,758 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 23 states. [2018-12-03 16:52:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:20,822 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 16:52:20,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:52:20,825 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2018-12-03 16:52:20,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:20,826 INFO L225 Difference]: With dead ends: 93 [2018-12-03 16:52:20,826 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 16:52:20,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:52:20,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 16:52:20,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 16:52:20,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 16:52:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 16:52:20,831 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 86 [2018-12-03 16:52:20,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:20,831 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 16:52:20,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:52:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 16:52:20,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 16:52:20,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:20,832 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:20,832 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:20,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:20,832 INFO L82 PathProgramCache]: Analyzing trace with hash -861112450, now seen corresponding path program 21 times [2018-12-03 16:52:20,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:20,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:20,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:20,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:20,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:21,116 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:21,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:21,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:21,117 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:21,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:21,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:21,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:21,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:21,132 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:21,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:21,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:21,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:21,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:21,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:21,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 16:52:21,729 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:21,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:52:21,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:52:21,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:52:21,731 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 24 states. [2018-12-03 16:52:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:21,817 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 16:52:21,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:52:21,817 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2018-12-03 16:52:21,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:21,818 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:52:21,818 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 16:52:21,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 157 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 16:52:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 16:52:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 16:52:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 16:52:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 16:52:21,821 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 90 [2018-12-03 16:52:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:21,821 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 16:52:21,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:52:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 16:52:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 16:52:21,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:21,822 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:21,823 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:21,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:21,823 INFO L82 PathProgramCache]: Analyzing trace with hash 215602728, now seen corresponding path program 22 times [2018-12-03 16:52:21,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:21,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:21,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:21,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:21,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:22,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:22,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:22,321 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:22,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:22,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:22,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:22,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:22,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:22,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:22,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:23,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:23,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 16:52:23,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:23,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:52:23,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:52:23,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:52:23,256 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 25 states. [2018-12-03 16:52:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:23,291 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 16:52:23,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:52:23,292 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-12-03 16:52:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:23,293 INFO L225 Difference]: With dead ends: 101 [2018-12-03 16:52:23,293 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 16:52:23,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:52:23,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 16:52:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 16:52:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 16:52:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 16:52:23,298 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 94 [2018-12-03 16:52:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:23,298 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 16:52:23,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:52:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 16:52:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 16:52:23,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:23,299 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:23,299 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:23,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:23,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1534865454, now seen corresponding path program 23 times [2018-12-03 16:52:23,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:23,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:23,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:23,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:23,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:23,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:23,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:23,630 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:23,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:23,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:23,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:23,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:23,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:23,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 16:52:23,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:23,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:23,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:24,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:24,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 16:52:24,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:24,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:52:24,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:52:24,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:52:24,359 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 26 states. [2018-12-03 16:52:24,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:24,528 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 16:52:24,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:52:24,529 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 98 [2018-12-03 16:52:24,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:24,530 INFO L225 Difference]: With dead ends: 105 [2018-12-03 16:52:24,530 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 16:52:24,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:52:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 16:52:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 16:52:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 16:52:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-03 16:52:24,533 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 98 [2018-12-03 16:52:24,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:24,533 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-03 16:52:24,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:52:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-03 16:52:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 16:52:24,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:24,535 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:24,535 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:24,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:24,535 INFO L82 PathProgramCache]: Analyzing trace with hash -35330948, now seen corresponding path program 24 times [2018-12-03 16:52:24,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:24,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:24,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:24,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:24,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:24,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:24,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:24,905 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:24,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:24,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:24,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:24,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:24,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:24,936 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:24,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:24,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:24,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:25,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:25,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 16:52:25,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:25,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:52:25,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:52:25,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:52:25,719 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 27 states. [2018-12-03 16:52:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:25,773 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 16:52:25,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:52:25,773 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2018-12-03 16:52:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:25,774 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:52:25,774 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 16:52:25,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:52:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 16:52:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 16:52:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 16:52:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-03 16:52:25,778 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 102 [2018-12-03 16:52:25,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:25,778 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-03 16:52:25,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:52:25,779 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-03 16:52:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 16:52:25,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:25,779 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:25,780 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:25,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:25,780 INFO L82 PathProgramCache]: Analyzing trace with hash -503868378, now seen corresponding path program 25 times [2018-12-03 16:52:25,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:25,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:25,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:25,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:25,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:26,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:26,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:26,120 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:26,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:26,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:26,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:26,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:26,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:26,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:26,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:27,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:27,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 16:52:27,489 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:27,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:52:27,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:52:27,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:52:27,490 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 28 states. [2018-12-03 16:52:27,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:27,531 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 16:52:27,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:52:27,531 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 106 [2018-12-03 16:52:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:27,532 INFO L225 Difference]: With dead ends: 113 [2018-12-03 16:52:27,532 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 16:52:27,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:52:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 16:52:27,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 16:52:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 16:52:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-03 16:52:27,536 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 106 [2018-12-03 16:52:27,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:27,537 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-03 16:52:27,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:52:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-03 16:52:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 16:52:27,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:27,537 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:27,538 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:27,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:27,538 INFO L82 PathProgramCache]: Analyzing trace with hash 410410704, now seen corresponding path program 26 times [2018-12-03 16:52:27,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:27,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:27,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:27,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:27,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:27,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:27,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:27,999 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:27,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:27,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:27,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:28,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:28,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:28,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 16:52:28,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:28,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:28,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:28,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:28,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 16:52:28,987 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:28,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 16:52:28,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 16:52:28,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:52:28,989 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 29 states. [2018-12-03 16:52:29,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:29,119 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-03 16:52:29,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:52:29,119 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 110 [2018-12-03 16:52:29,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:29,121 INFO L225 Difference]: With dead ends: 117 [2018-12-03 16:52:29,121 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 16:52:29,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:52:29,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 16:52:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 16:52:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 16:52:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-12-03 16:52:29,125 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 110 [2018-12-03 16:52:29,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:29,125 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-12-03 16:52:29,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 16:52:29,125 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-12-03 16:52:29,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 16:52:29,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:29,126 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:29,126 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:29,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:29,126 INFO L82 PathProgramCache]: Analyzing trace with hash 131843194, now seen corresponding path program 27 times [2018-12-03 16:52:29,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:29,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:29,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:29,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:29,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:30,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:30,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:30,209 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:30,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:30,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:30,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:30,219 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:30,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:30,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:30,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:30,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:30,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:31,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:31,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 16:52:31,128 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:31,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:52:31,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:52:31,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:52:31,130 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 30 states. [2018-12-03 16:52:31,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:31,174 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-12-03 16:52:31,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:52:31,175 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 114 [2018-12-03 16:52:31,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:31,176 INFO L225 Difference]: With dead ends: 121 [2018-12-03 16:52:31,176 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 16:52:31,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:52:31,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 16:52:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-03 16:52:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-03 16:52:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-12-03 16:52:31,181 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 114 [2018-12-03 16:52:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:31,181 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-12-03 16:52:31,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:52:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-12-03 16:52:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 16:52:31,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:31,182 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:31,182 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:31,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:31,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1432503588, now seen corresponding path program 28 times [2018-12-03 16:52:31,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:31,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:31,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:31,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:31,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:31,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:31,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:31,655 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:31,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:31,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:31,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:31,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:31,665 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:31,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:31,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:33,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:33,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 16:52:33,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:33,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:52:33,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:52:33,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:52:33,011 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 31 states. [2018-12-03 16:52:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:33,085 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-12-03 16:52:33,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:52:33,085 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 118 [2018-12-03 16:52:33,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:33,087 INFO L225 Difference]: With dead ends: 125 [2018-12-03 16:52:33,087 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 16:52:33,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:52:33,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 16:52:33,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-03 16:52:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 16:52:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-12-03 16:52:33,092 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 118 [2018-12-03 16:52:33,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:33,092 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-12-03 16:52:33,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:52:33,092 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-12-03 16:52:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 16:52:33,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:33,093 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:33,093 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:33,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:33,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2063310642, now seen corresponding path program 29 times [2018-12-03 16:52:33,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:33,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:33,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:33,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:33,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:33,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:33,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:33,711 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:33,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:33,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:33,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:33,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:33,719 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:33,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 16:52:33,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:33,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:33,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:34,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:34,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:34,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 16:52:34,771 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:34,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:52:34,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:52:34,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:52:34,772 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 32 states. [2018-12-03 16:52:34,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:34,885 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-12-03 16:52:34,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:52:34,886 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 122 [2018-12-03 16:52:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:34,887 INFO L225 Difference]: With dead ends: 129 [2018-12-03 16:52:34,887 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 16:52:34,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:52:34,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 16:52:34,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 16:52:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 16:52:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-12-03 16:52:34,892 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 122 [2018-12-03 16:52:34,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:34,892 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-12-03 16:52:34,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:52:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-12-03 16:52:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 16:52:34,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:34,893 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:34,894 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:34,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:34,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1719888008, now seen corresponding path program 30 times [2018-12-03 16:52:34,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:34,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:34,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:34,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:34,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:35,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:35,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:35,335 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:35,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:35,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:35,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:35,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:35,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:35,370 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:35,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:35,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:35,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:35,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:36,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:36,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 16:52:36,494 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:36,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:52:36,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:52:36,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:52:36,495 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 33 states. [2018-12-03 16:52:36,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:36,558 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-12-03 16:52:36,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:52:36,559 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 126 [2018-12-03 16:52:36,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:36,560 INFO L225 Difference]: With dead ends: 133 [2018-12-03 16:52:36,560 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 16:52:36,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:52:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 16:52:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-03 16:52:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 16:52:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-12-03 16:52:36,564 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 126 [2018-12-03 16:52:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:36,565 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-12-03 16:52:36,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:52:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-12-03 16:52:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 16:52:36,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:36,566 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:36,566 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:36,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:36,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1270519518, now seen corresponding path program 31 times [2018-12-03 16:52:36,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:36,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:36,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:36,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:36,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:37,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:37,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:37,082 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:37,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:37,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:37,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:37,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:37,093 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:37,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:37,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:38,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:38,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 16:52:38,593 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:38,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:52:38,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:52:38,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:52:38,594 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 34 states. [2018-12-03 16:52:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:38,646 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-12-03 16:52:38,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:52:38,646 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 130 [2018-12-03 16:52:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:38,647 INFO L225 Difference]: With dead ends: 137 [2018-12-03 16:52:38,647 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 16:52:38,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:52:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 16:52:38,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-03 16:52:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 16:52:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-12-03 16:52:38,652 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 130 [2018-12-03 16:52:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:38,652 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-12-03 16:52:38,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:52:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-12-03 16:52:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 16:52:38,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:38,653 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:38,653 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:38,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:38,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1248242228, now seen corresponding path program 32 times [2018-12-03 16:52:38,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:38,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:38,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:39,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:39,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:39,234 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:39,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:39,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:39,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:39,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:39,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:39,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 16:52:39,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:39,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:39,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:40,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:40,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 16:52:40,565 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:40,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:52:40,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:52:40,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:52:40,567 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 35 states. [2018-12-03 16:52:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:40,673 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-12-03 16:52:40,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:52:40,674 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2018-12-03 16:52:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:40,675 INFO L225 Difference]: With dead ends: 141 [2018-12-03 16:52:40,675 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 16:52:40,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:52:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 16:52:40,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 16:52:40,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 16:52:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-12-03 16:52:40,679 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 134 [2018-12-03 16:52:40,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:40,679 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-12-03 16:52:40,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:52:40,680 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-12-03 16:52:40,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 16:52:40,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:40,681 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:40,681 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:40,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:40,681 INFO L82 PathProgramCache]: Analyzing trace with hash -596451978, now seen corresponding path program 33 times [2018-12-03 16:52:40,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:40,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:40,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:40,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:40,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:41,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:41,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:41,408 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:41,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:41,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:41,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:41,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:41,419 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:41,447 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:41,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:41,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:41,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:43,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:43,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 16:52:43,132 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:43,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:52:43,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:52:43,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:52:43,134 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 36 states. [2018-12-03 16:52:43,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:43,224 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-12-03 16:52:43,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:52:43,225 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 138 [2018-12-03 16:52:43,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:43,226 INFO L225 Difference]: With dead ends: 145 [2018-12-03 16:52:43,226 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 16:52:43,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:52:43,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 16:52:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-12-03 16:52:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-03 16:52:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-12-03 16:52:43,229 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 138 [2018-12-03 16:52:43,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:43,229 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-12-03 16:52:43,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:52:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-12-03 16:52:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 16:52:43,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:43,230 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:43,230 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:43,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:43,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1720483872, now seen corresponding path program 34 times [2018-12-03 16:52:43,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:43,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:43,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:43,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:43,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:43,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:43,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:43,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:43,793 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:43,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:43,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:43,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:43,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:43,802 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:43,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:43,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:45,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:45,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 16:52:45,431 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:45,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:52:45,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:52:45,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:52:45,432 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 37 states. [2018-12-03 16:52:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:45,489 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-12-03 16:52:45,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:52:45,490 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 142 [2018-12-03 16:52:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:45,491 INFO L225 Difference]: With dead ends: 149 [2018-12-03 16:52:45,492 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 16:52:45,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:52:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 16:52:45,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-03 16:52:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 16:52:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-12-03 16:52:45,495 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 142 [2018-12-03 16:52:45,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:45,495 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-12-03 16:52:45,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:52:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-12-03 16:52:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 16:52:45,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:45,496 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:45,497 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:45,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:45,497 INFO L82 PathProgramCache]: Analyzing trace with hash 811646410, now seen corresponding path program 35 times [2018-12-03 16:52:45,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:45,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:45,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:45,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:45,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:46,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:46,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:46,717 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:46,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:46,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:46,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:46,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:46,727 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:46,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 16:52:46,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:46,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:46,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:48,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:48,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 16:52:48,475 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:48,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:52:48,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:52:48,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:52:48,476 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 38 states. [2018-12-03 16:52:48,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:48,657 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-12-03 16:52:48,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:52:48,657 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 146 [2018-12-03 16:52:48,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:48,659 INFO L225 Difference]: With dead ends: 153 [2018-12-03 16:52:48,659 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 16:52:48,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:52:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 16:52:48,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 16:52:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 16:52:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-12-03 16:52:48,664 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 146 [2018-12-03 16:52:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:48,664 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-12-03 16:52:48,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:52:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-12-03 16:52:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 16:52:48,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:48,665 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:48,665 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:48,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:48,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1428821620, now seen corresponding path program 36 times [2018-12-03 16:52:48,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:48,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:48,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:48,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:48,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:50,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:50,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:50,061 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:50,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:50,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:50,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:50,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:50,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:50,101 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:50,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:50,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:50,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:50,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:51,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:51,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 16:52:51,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:51,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:52:51,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:52:51,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:52:51,940 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 39 states. [2018-12-03 16:52:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:51,991 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-12-03 16:52:51,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:52:51,992 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-12-03 16:52:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:51,994 INFO L225 Difference]: With dead ends: 157 [2018-12-03 16:52:51,994 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 16:52:51,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:52:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 16:52:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-03 16:52:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-03 16:52:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-12-03 16:52:51,999 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 150 [2018-12-03 16:52:51,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:51,999 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-12-03 16:52:52,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:52:52,000 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-12-03 16:52:52,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 16:52:52,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:52,001 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:52,001 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:52,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:52,001 INFO L82 PathProgramCache]: Analyzing trace with hash -823981538, now seen corresponding path program 37 times [2018-12-03 16:52:52,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:52,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:52,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:52,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:52,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:53,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:53,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:53,006 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:53,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:53,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:53,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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:53,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:53,016 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:53,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:53,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:54,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:54,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 16:52:54,693 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:54,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:52:54,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:52:54,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:52:54,695 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 40 states. [2018-12-03 16:52:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:54,760 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-12-03 16:52:54,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:52:54,760 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 154 [2018-12-03 16:52:54,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:54,762 INFO L225 Difference]: With dead ends: 161 [2018-12-03 16:52:54,762 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 16:52:54,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:52:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 16:52:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-03 16:52:54,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-03 16:52:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-12-03 16:52:54,767 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 154 [2018-12-03 16:52:54,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:54,767 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-12-03 16:52:54,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:52:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-12-03 16:52:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 16:52:54,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:54,768 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:54,769 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:54,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:54,769 INFO L82 PathProgramCache]: Analyzing trace with hash 373692616, now seen corresponding path program 38 times [2018-12-03 16:52:54,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:54,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:54,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:54,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:54,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:55,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:55,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:55,660 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:55,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:55,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:55,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:55,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:55,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:55,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 16:52:55,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:55,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:55,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:58,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:58,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 16:52:58,858 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:58,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:52:58,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:52:58,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:52:58,859 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 41 states. [2018-12-03 16:52:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:59,565 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-12-03 16:52:59,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:52:59,565 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 158 [2018-12-03 16:52:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:59,566 INFO L225 Difference]: With dead ends: 165 [2018-12-03 16:52:59,566 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 16:52:59,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:52:59,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 16:52:59,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-03 16:52:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 16:52:59,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-12-03 16:52:59,570 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 158 [2018-12-03 16:52:59,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:59,570 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-12-03 16:52:59,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:52:59,571 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-12-03 16:52:59,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 16:52:59,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:59,572 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-12-03 16:52:59,572 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:59,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:59,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1026702734, now seen corresponding path program 39 times [2018-12-03 16:52:59,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:59,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:59,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:59,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:59,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:00,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:00,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:00,237 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:00,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:00,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:00,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:00,247 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:00,247 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:00,275 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:00,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:00,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:00,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:02,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:02,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 16:53:02,046 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:02,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:53:02,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:53:02,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:53:02,047 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 42 states. [2018-12-03 16:53:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:02,120 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-12-03 16:53:02,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:53:02,121 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2018-12-03 16:53:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:02,123 INFO L225 Difference]: With dead ends: 169 [2018-12-03 16:53:02,123 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 16:53:02,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:53:02,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 16:53:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-12-03 16:53:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-03 16:53:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-12-03 16:53:02,127 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 162 [2018-12-03 16:53:02,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:02,127 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-12-03 16:53:02,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:53:02,128 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-12-03 16:53:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-03 16:53:02,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:02,129 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-12-03 16:53:02,129 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:02,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:02,129 INFO L82 PathProgramCache]: Analyzing trace with hash 716474140, now seen corresponding path program 40 times [2018-12-03 16:53:02,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:02,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:02,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:02,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:02,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:03,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:03,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:03,262 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:03,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:03,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:03,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:03,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:03,271 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:03,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:03,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:05,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:05,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 16:53:05,231 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:05,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:53:05,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:53:05,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:53:05,232 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 43 states. [2018-12-03 16:53:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:05,350 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-12-03 16:53:05,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:53:05,350 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 166 [2018-12-03 16:53:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:05,352 INFO L225 Difference]: With dead ends: 173 [2018-12-03 16:53:05,352 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 16:53:05,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:53:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 16:53:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-03 16:53:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 16:53:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-12-03 16:53:05,357 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 166 [2018-12-03 16:53:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:05,357 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-12-03 16:53:05,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:53:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-12-03 16:53:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 16:53:05,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:05,358 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-12-03 16:53:05,359 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:05,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:05,359 INFO L82 PathProgramCache]: Analyzing trace with hash 49604294, now seen corresponding path program 41 times [2018-12-03 16:53:05,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:05,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:05,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:05,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:05,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:08,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:08,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:08,624 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:08,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:08,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:08,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:08,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:08,633 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:08,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 16:53:08,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:08,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:08,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:10,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:10,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 16:53:10,659 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:10,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:53:10,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:53:10,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:53:10,660 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 44 states. [2018-12-03 16:53:10,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:10,780 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-12-03 16:53:10,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:53:10,781 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 170 [2018-12-03 16:53:10,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:10,782 INFO L225 Difference]: With dead ends: 177 [2018-12-03 16:53:10,782 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 16:53:10,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:53:10,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 16:53:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-03 16:53:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 16:53:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-12-03 16:53:10,786 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 170 [2018-12-03 16:53:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:10,787 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-12-03 16:53:10,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:53:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-12-03 16:53:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 16:53:10,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:10,788 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-12-03 16:53:10,788 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:10,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:10,789 INFO L82 PathProgramCache]: Analyzing trace with hash -11968144, now seen corresponding path program 42 times [2018-12-03 16:53:10,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:10,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:10,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:10,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:10,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:12,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:12,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:12,853 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:12,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:12,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:12,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:12,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:12,864 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:12,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:12,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:12,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:12,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:15,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:15,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 16:53:15,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:15,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:53:15,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:53:15,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:53:15,190 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 45 states. [2018-12-03 16:53:15,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:15,279 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-12-03 16:53:15,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:53:15,279 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 174 [2018-12-03 16:53:15,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:15,280 INFO L225 Difference]: With dead ends: 181 [2018-12-03 16:53:15,280 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 16:53:15,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:53:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 16:53:15,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-12-03 16:53:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-03 16:53:15,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-12-03 16:53:15,284 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 174 [2018-12-03 16:53:15,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:15,284 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-12-03 16:53:15,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:53:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-12-03 16:53:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-03 16:53:15,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:15,286 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-12-03 16:53:15,286 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:15,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:15,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1915516698, now seen corresponding path program 43 times [2018-12-03 16:53:15,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:15,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:15,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:15,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:15,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:16,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:16,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:16,878 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:16,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:16,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:16,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:16,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:16,887 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:16,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:16,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:19,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:19,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 16:53:19,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:19,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:53:19,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:53:19,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:53:19,457 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 46 states. [2018-12-03 16:53:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:19,546 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-12-03 16:53:19,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:53:19,547 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 178 [2018-12-03 16:53:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:19,548 INFO L225 Difference]: With dead ends: 185 [2018-12-03 16:53:19,548 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 16:53:19,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:53:19,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 16:53:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-12-03 16:53:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-03 16:53:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-12-03 16:53:19,552 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 178 [2018-12-03 16:53:19,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:19,552 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-12-03 16:53:19,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:53:19,553 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-12-03 16:53:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-03 16:53:19,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:19,554 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-12-03 16:53:19,554 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:19,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:19,554 INFO L82 PathProgramCache]: Analyzing trace with hash -321345596, now seen corresponding path program 44 times [2018-12-03 16:53:19,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:19,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:19,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:19,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:19,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:20,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:20,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:20,488 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:20,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:20,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:20,488 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 16:53:20,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:20,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:20,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-03 16:53:20,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:20,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:20,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:22,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:22,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 16:53:22,723 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:22,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:53:22,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:53:22,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:53:22,724 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 47 states. [2018-12-03 16:53:22,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:22,804 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-12-03 16:53:22,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:53:22,804 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 182 [2018-12-03 16:53:22,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:22,806 INFO L225 Difference]: With dead ends: 189 [2018-12-03 16:53:22,806 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 16:53:22,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:53:22,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 16:53:22,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-03 16:53:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-03 16:53:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-12-03 16:53:22,810 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 182 [2018-12-03 16:53:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:22,810 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-12-03 16:53:22,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:53:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-12-03 16:53:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-03 16:53:22,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:22,812 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-12-03 16:53:22,812 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:22,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:22,812 INFO L82 PathProgramCache]: Analyzing trace with hash -548899986, now seen corresponding path program 45 times [2018-12-03 16:53:22,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:22,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:22,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:22,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:22,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:23,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:23,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:23,942 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:23,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:23,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:23,942 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 16:53:23,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:23,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:23,987 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:23,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:23,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:24,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:26,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:26,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 16:53:26,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:26,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:53:26,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:53:26,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:53:26,457 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 48 states. [2018-12-03 16:53:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:26,574 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-12-03 16:53:26,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:53:26,574 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 186 [2018-12-03 16:53:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:26,576 INFO L225 Difference]: With dead ends: 193 [2018-12-03 16:53:26,576 INFO L226 Difference]: Without dead ends: 191 [2018-12-03 16:53:26,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:53:26,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-03 16:53:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-12-03 16:53:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-03 16:53:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-12-03 16:53:26,580 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 186 [2018-12-03 16:53:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:26,580 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-12-03 16:53:26,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:53:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-12-03 16:53:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-03 16:53:26,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:26,582 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-12-03 16:53:26,582 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:26,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:26,582 INFO L82 PathProgramCache]: Analyzing trace with hash 943086104, now seen corresponding path program 46 times [2018-12-03 16:53:26,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:26,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:26,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:26,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:26,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:27,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:27,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:27,699 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:27,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:27,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:27,699 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 16:53:27,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:27,708 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:27,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:27,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:30,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:30,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 16:53:30,859 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:30,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:53:30,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:53:30,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:53:30,860 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 49 states. [2018-12-03 16:53:30,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:30,948 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-12-03 16:53:30,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:53:30,949 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 190 [2018-12-03 16:53:30,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:30,950 INFO L225 Difference]: With dead ends: 197 [2018-12-03 16:53:30,950 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 16:53:30,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:53:30,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 16:53:30,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-12-03 16:53:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-03 16:53:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-12-03 16:53:30,955 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 190 [2018-12-03 16:53:30,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:30,955 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-12-03 16:53:30,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:53:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-12-03 16:53:30,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-03 16:53:30,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:30,957 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-12-03 16:53:30,957 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:30,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:30,957 INFO L82 PathProgramCache]: Analyzing trace with hash 85777346, now seen corresponding path program 47 times [2018-12-03 16:53:30,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:30,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:30,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:30,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:30,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:31,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:31,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:31,986 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:31,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:31,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:31,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:53:31,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:31,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:32,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-03 16:53:32,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:32,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:32,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:34,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:34,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 16:53:34,952 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:34,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:53:34,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:53:34,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:53:34,954 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 50 states. [2018-12-03 16:53:35,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:35,056 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-12-03 16:53:35,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:53:35,057 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 194 [2018-12-03 16:53:35,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:35,058 INFO L225 Difference]: With dead ends: 201 [2018-12-03 16:53:35,058 INFO L226 Difference]: Without dead ends: 199 [2018-12-03 16:53:35,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:53:35,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-03 16:53:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-12-03 16:53:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-03 16:53:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-12-03 16:53:35,063 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 194 [2018-12-03 16:53:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:35,063 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-12-03 16:53:35,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:53:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-12-03 16:53:35,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-03 16:53:35,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:35,064 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-12-03 16:53:35,064 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:35,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:35,065 INFO L82 PathProgramCache]: Analyzing trace with hash 305559660, now seen corresponding path program 48 times [2018-12-03 16:53:35,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:35,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:35,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:35,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:35,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:36,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:36,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:36,371 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:36,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:36,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:36,371 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 16:53:36,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:36,380 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:36,418 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:36,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:36,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:36,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:39,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:39,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 16:53:39,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:39,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:53:39,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:53:39,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:53:39,193 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 51 states. [2018-12-03 16:53:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:39,306 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-12-03 16:53:39,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:53:39,306 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 198 [2018-12-03 16:53:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:39,308 INFO L225 Difference]: With dead ends: 205 [2018-12-03 16:53:39,308 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 16:53:39,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:53:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 16:53:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-12-03 16:53:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 16:53:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-12-03 16:53:39,312 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 198 [2018-12-03 16:53:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:39,312 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-12-03 16:53:39,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:53:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-12-03 16:53:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-03 16:53:39,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:39,313 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-12-03 16:53:39,314 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:39,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:39,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1971474410, now seen corresponding path program 49 times [2018-12-03 16:53:39,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:39,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:39,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:40,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:40,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:40,341 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:40,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:40,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:40,341 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 16:53:40,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:40,350 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:40,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:40,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:43,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:43,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:43,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 16:53:43,229 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:43,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:53:43,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:53:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:53:43,230 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 52 states. [2018-12-03 16:53:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:43,301 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-12-03 16:53:43,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:53:43,302 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 202 [2018-12-03 16:53:43,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:43,303 INFO L225 Difference]: With dead ends: 209 [2018-12-03 16:53:43,304 INFO L226 Difference]: Without dead ends: 207 [2018-12-03 16:53:43,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:53:43,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-03 16:53:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-12-03 16:53:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 16:53:43,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-12-03 16:53:43,308 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 202 [2018-12-03 16:53:43,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:43,308 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-12-03 16:53:43,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:53:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-12-03 16:53:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-03 16:53:43,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:43,310 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-12-03 16:53:43,310 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:43,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:43,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1750269248, now seen corresponding path program 50 times [2018-12-03 16:53:43,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:43,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:43,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:43,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:43,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:44,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:44,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:44,808 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:44,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:44,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:44,808 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 16:53:44,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:44,827 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:45,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-03 16:53:45,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:45,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:45,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:48,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:48,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 16:53:48,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:48,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:53:48,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:53:48,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:53:48,309 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 53 states. [2018-12-03 16:53:48,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:48,423 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-12-03 16:53:48,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:53:48,424 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 206 [2018-12-03 16:53:48,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:48,426 INFO L225 Difference]: With dead ends: 213 [2018-12-03 16:53:48,426 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 16:53:48,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:53:48,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 16:53:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-03 16:53:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-03 16:53:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-12-03 16:53:48,430 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 206 [2018-12-03 16:53:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:48,431 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-12-03 16:53:48,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:53:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-12-03 16:53:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-03 16:53:48,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:48,432 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-12-03 16:53:48,432 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:48,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:48,433 INFO L82 PathProgramCache]: Analyzing trace with hash 37679210, now seen corresponding path program 51 times [2018-12-03 16:53:48,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:48,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:48,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:48,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:48,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:49,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:49,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:49,954 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:49,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:49,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:49,954 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 16:53:49,964 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:49,964 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:50,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:50,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:50,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:50,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:52,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:52,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 16:53:52,949 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:52,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:53:52,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:53:52,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:53:52,950 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 54 states. [2018-12-03 16:53:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:53,059 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-12-03 16:53:53,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:53:53,059 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 210 [2018-12-03 16:53:53,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:53,061 INFO L225 Difference]: With dead ends: 217 [2018-12-03 16:53:53,061 INFO L226 Difference]: Without dead ends: 215 [2018-12-03 16:53:53,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:53:53,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-03 16:53:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-12-03 16:53:53,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-12-03 16:53:53,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-12-03 16:53:53,065 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 210 [2018-12-03 16:53:53,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:53,065 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-12-03 16:53:53,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:53:53,065 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-12-03 16:53:53,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-12-03 16:53:53,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:53,066 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-12-03 16:53:53,067 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:53,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:53,067 INFO L82 PathProgramCache]: Analyzing trace with hash -781321964, now seen corresponding path program 52 times [2018-12-03 16:53:53,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:53,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:53,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:53,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:53,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:54,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:54,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:54,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:54,768 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:54,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:54,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:54,769 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 16:53:54,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:54,779 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:54,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:54,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:57,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:57,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 16:53:57,919 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:57,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:53:57,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:53:57,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:53:57,920 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 55 states. [2018-12-03 16:53:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:58,035 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-12-03 16:53:58,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:53:58,035 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 214 [2018-12-03 16:53:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:58,037 INFO L225 Difference]: With dead ends: 221 [2018-12-03 16:53:58,037 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 16:53:58,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:53:58,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 16:53:58,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-12-03 16:53:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-12-03 16:53:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-12-03 16:53:58,041 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 214 [2018-12-03 16:53:58,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:58,041 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-12-03 16:53:58,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:53:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-12-03 16:53:58,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-03 16:53:58,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:58,042 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-12-03 16:53:58,043 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:58,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:58,043 INFO L82 PathProgramCache]: Analyzing trace with hash -348873538, now seen corresponding path program 53 times [2018-12-03 16:53:58,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:58,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:58,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:58,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:58,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:59,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:59,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:59,564 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:59,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:59,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:59,564 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 16:53:59,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:59,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:59,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-03 16:53:59,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:59,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:59,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:02,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:02,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 16:54:02,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:02,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:54:02,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:54:02,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:54:02,793 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 56 states. [2018-12-03 16:54:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:02,919 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-12-03 16:54:02,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:54:02,920 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 218 [2018-12-03 16:54:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:02,921 INFO L225 Difference]: With dead ends: 225 [2018-12-03 16:54:02,921 INFO L226 Difference]: Without dead ends: 223 [2018-12-03 16:54:02,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:54:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-12-03 16:54:02,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-12-03 16:54:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-12-03 16:54:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-12-03 16:54:02,925 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 218 [2018-12-03 16:54:02,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:02,925 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-12-03 16:54:02,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:54:02,925 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-12-03 16:54:02,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-03 16:54:02,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:02,926 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-12-03 16:54:02,926 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:02,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:02,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1269998744, now seen corresponding path program 54 times [2018-12-03 16:54:02,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:02,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:02,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:02,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:02,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:04,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:04,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:04,148 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:04,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:04,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:04,149 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 16:54:04,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:04,158 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:04,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:04,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:04,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:04,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:07,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:07,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 16:54:07,564 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:07,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:54:07,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:54:07,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:54:07,565 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 57 states. [2018-12-03 16:54:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:07,661 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-12-03 16:54:07,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:54:07,661 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 222 [2018-12-03 16:54:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:07,663 INFO L225 Difference]: With dead ends: 229 [2018-12-03 16:54:07,663 INFO L226 Difference]: Without dead ends: 227 [2018-12-03 16:54:07,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:54:07,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-03 16:54:07,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-12-03 16:54:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-03 16:54:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-12-03 16:54:07,668 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 222 [2018-12-03 16:54:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:07,668 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-12-03 16:54:07,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:54:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-12-03 16:54:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-03 16:54:07,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:07,670 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-12-03 16:54:07,670 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:07,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:07,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1338854126, now seen corresponding path program 55 times [2018-12-03 16:54:07,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:07,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:07,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:07,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:07,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:08,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:08,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:08,837 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:08,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:08,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:08,837 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 16:54:08,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:08,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:08,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:08,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:12,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:12,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 16:54:12,515 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:12,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:54:12,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:54:12,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:54:12,517 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 58 states. [2018-12-03 16:54:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:12,680 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-12-03 16:54:12,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:54:12,680 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 226 [2018-12-03 16:54:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:12,682 INFO L225 Difference]: With dead ends: 233 [2018-12-03 16:54:12,682 INFO L226 Difference]: Without dead ends: 231 [2018-12-03 16:54:12,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:54:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-03 16:54:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-12-03 16:54:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-03 16:54:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-12-03 16:54:12,687 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 226 [2018-12-03 16:54:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:12,687 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-12-03 16:54:12,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:54:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-12-03 16:54:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-12-03 16:54:12,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:12,689 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-12-03 16:54:12,689 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:12,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:12,689 INFO L82 PathProgramCache]: Analyzing trace with hash 555690428, now seen corresponding path program 56 times [2018-12-03 16:54:12,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:12,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:12,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:12,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:12,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:13,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:13,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:13,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:13,981 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:13,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 16:54:13,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:13,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 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 16:54:13,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:13,991 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:14,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-03 16:54:14,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:14,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:14,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:17,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:17,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 16:54:17,841 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:17,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 16:54:17,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 16:54:17,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:54:17,843 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 59 states. [2018-12-03 16:54:17,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:17,955 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-12-03 16:54:17,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:54:17,956 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 230 [2018-12-03 16:54:17,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:17,957 INFO L225 Difference]: With dead ends: 237 [2018-12-03 16:54:17,957 INFO L226 Difference]: Without dead ends: 235 [2018-12-03 16:54:17,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:54:17,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-12-03 16:54:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-12-03 16:54:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-12-03 16:54:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-12-03 16:54:17,960 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 230 [2018-12-03 16:54:17,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:17,961 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-12-03 16:54:17,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 16:54:17,961 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-12-03 16:54:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-03 16:54:17,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:17,962 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-12-03 16:54:17,962 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:17,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:17,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1475528346, now seen corresponding path program 57 times [2018-12-03 16:54:17,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:17,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:17,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:17,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:17,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:19,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:19,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:19,267 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:19,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:19,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:19,267 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 16:54:19,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:19,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:19,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:19,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:19,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:19,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:23,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:23,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 16:54:23,143 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:23,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:54:23,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:54:23,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:54:23,145 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 60 states. [2018-12-03 16:54:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:23,301 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-12-03 16:54:23,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:54:23,302 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 234 [2018-12-03 16:54:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:23,303 INFO L225 Difference]: With dead ends: 241 [2018-12-03 16:54:23,304 INFO L226 Difference]: Without dead ends: 239 [2018-12-03 16:54:23,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:54:23,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-03 16:54:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-12-03 16:54:23,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-12-03 16:54:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-12-03 16:54:23,307 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 234 [2018-12-03 16:54:23,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:23,307 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-12-03 16:54:23,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:54:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-12-03 16:54:23,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-03 16:54:23,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:23,308 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-12-03 16:54:23,308 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:23,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:23,309 INFO L82 PathProgramCache]: Analyzing trace with hash -457743344, now seen corresponding path program 58 times [2018-12-03 16:54:23,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:23,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:23,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:23,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:23,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:24,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:24,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:24,588 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:24,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:24,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:24,588 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 16:54:24,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:24,599 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:24,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:24,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:28,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:28,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 16:54:28,628 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:28,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 16:54:28,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 16:54:28,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:54:28,629 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 61 states. [2018-12-03 16:54:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:28,816 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-12-03 16:54:28,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:54:28,817 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 238 [2018-12-03 16:54:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:28,818 INFO L225 Difference]: With dead ends: 245 [2018-12-03 16:54:28,819 INFO L226 Difference]: Without dead ends: 243 [2018-12-03 16:54:28,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:54:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-03 16:54:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-12-03 16:54:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-03 16:54:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-12-03 16:54:28,822 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 238 [2018-12-03 16:54:28,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:28,823 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-12-03 16:54:28,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 16:54:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-12-03 16:54:28,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-12-03 16:54:28,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:28,824 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-12-03 16:54:28,824 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:28,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:28,824 INFO L82 PathProgramCache]: Analyzing trace with hash 362293690, now seen corresponding path program 59 times [2018-12-03 16:54:28,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:28,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:28,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:28,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:28,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:30,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:30,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:30,653 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:30,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:30,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:30,653 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 16:54:30,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:30,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:30,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 16:54:30,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:30,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:30,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:34,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:34,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 16:54:34,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:34,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:54:34,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:54:34,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:54:34,578 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 62 states. [2018-12-03 16:54:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:34,746 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-12-03 16:54:34,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:54:34,746 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 242 [2018-12-03 16:54:34,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:34,748 INFO L225 Difference]: With dead ends: 249 [2018-12-03 16:54:34,748 INFO L226 Difference]: Without dead ends: 247 [2018-12-03 16:54:34,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:54:34,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-12-03 16:54:34,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-12-03 16:54:34,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-03 16:54:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-12-03 16:54:34,753 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 242 [2018-12-03 16:54:34,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:34,753 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-12-03 16:54:34,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:54:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-12-03 16:54:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-03 16:54:34,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:34,755 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-12-03 16:54:34,755 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:34,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:34,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1209398684, now seen corresponding path program 60 times [2018-12-03 16:54:34,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:34,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:34,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:34,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:34,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:36,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:36,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:36,541 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:36,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:36,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:36,541 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 16:54:36,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:36,551 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:36,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:36,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:36,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:36,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:40,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:40,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 16:54:40,784 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:40,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 16:54:40,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 16:54:40,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:54:40,786 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 63 states. [2018-12-03 16:54:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:40,985 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-12-03 16:54:40,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:54:40,986 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 246 [2018-12-03 16:54:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:40,987 INFO L225 Difference]: With dead ends: 253 [2018-12-03 16:54:40,987 INFO L226 Difference]: Without dead ends: 251 [2018-12-03 16:54:40,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:54:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-03 16:54:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-12-03 16:54:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-03 16:54:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-12-03 16:54:40,991 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 246 [2018-12-03 16:54:40,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:40,992 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-12-03 16:54:40,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 16:54:40,992 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-12-03 16:54:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-03 16:54:40,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:40,993 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-12-03 16:54:40,993 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:40,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:40,993 INFO L82 PathProgramCache]: Analyzing trace with hash 665290254, now seen corresponding path program 61 times [2018-12-03 16:54:40,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:40,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:40,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:40,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:40,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:42,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:42,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:42,453 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:42,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:42,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:42,453 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 16:54:42,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:42,463 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:42,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:42,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:46,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:46,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 16:54:46,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:46,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:54:46,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:54:46,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:54:46,820 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 64 states. [2018-12-03 16:54:46,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:46,977 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-12-03 16:54:46,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:54:46,978 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 250 [2018-12-03 16:54:46,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:46,980 INFO L225 Difference]: With dead ends: 257 [2018-12-03 16:54:46,980 INFO L226 Difference]: Without dead ends: 255 [2018-12-03 16:54:46,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:54:46,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-12-03 16:54:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-12-03 16:54:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-03 16:54:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-12-03 16:54:46,985 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 250 [2018-12-03 16:54:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:46,985 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-12-03 16:54:46,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:54:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-12-03 16:54:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-12-03 16:54:46,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:46,986 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-12-03 16:54:46,986 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:46,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:46,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1066081464, now seen corresponding path program 62 times [2018-12-03 16:54:46,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:46,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:46,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:46,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:46,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:48,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:48,489 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:48,489 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:48,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:48,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:48,489 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:54:48,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:48,498 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:48,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-03 16:54:48,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:48,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:48,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:53,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:53,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 16:54:53,025 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:53,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:54:53,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:54:53,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:54:53,027 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 65 states. [2018-12-03 16:54:53,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:53,177 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-12-03 16:54:53,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:54:53,178 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 254 [2018-12-03 16:54:53,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:53,179 INFO L225 Difference]: With dead ends: 261 [2018-12-03 16:54:53,179 INFO L226 Difference]: Without dead ends: 259 [2018-12-03 16:54:53,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:54:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-12-03 16:54:53,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-12-03 16:54:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-03 16:54:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-12-03 16:54:53,183 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 254 [2018-12-03 16:54:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:53,184 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-12-03 16:54:53,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:54:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-12-03 16:54:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-03 16:54:53,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:53,185 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-12-03 16:54:53,185 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:53,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:53,186 INFO L82 PathProgramCache]: Analyzing trace with hash -116437406, now seen corresponding path program 63 times [2018-12-03 16:54:53,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:53,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:53,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:53,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:53,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:54,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:54,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:54,716 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:54,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:54,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:54,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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:54,727 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:54,727 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:54,776 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:54,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:54,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:54,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:59,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:59,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 16:54:59,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:59,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:54:59,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:54:59,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:54:59,327 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 66 states. [2018-12-03 16:54:59,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:59,524 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-12-03 16:54:59,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:54:59,524 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 258 [2018-12-03 16:54:59,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:59,526 INFO L225 Difference]: With dead ends: 265 [2018-12-03 16:54:59,526 INFO L226 Difference]: Without dead ends: 263 [2018-12-03 16:54:59,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:54:59,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-12-03 16:54:59,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-12-03 16:54:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-03 16:54:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-12-03 16:54:59,530 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 258 [2018-12-03 16:54:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:59,531 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-12-03 16:54:59,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:54:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-12-03 16:54:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-12-03 16:54:59,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:59,532 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-12-03 16:54:59,532 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:59,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:59,533 INFO L82 PathProgramCache]: Analyzing trace with hash 208575244, now seen corresponding path program 64 times [2018-12-03 16:54:59,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:59,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:59,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:59,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:59,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:01,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:01,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:01,452 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:01,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:01,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:01,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:01,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:01,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:01,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:01,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:06,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:06,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 16:55:06,173 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:06,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 16:55:06,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 16:55:06,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:55:06,175 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 67 states. [2018-12-03 16:55:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:06,291 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-12-03 16:55:06,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:55:06,291 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 262 [2018-12-03 16:55:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:06,292 INFO L225 Difference]: With dead ends: 269 [2018-12-03 16:55:06,292 INFO L226 Difference]: Without dead ends: 267 [2018-12-03 16:55:06,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:55:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-03 16:55:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-12-03 16:55:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-12-03 16:55:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-12-03 16:55:06,296 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 262 [2018-12-03 16:55:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:06,297 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-12-03 16:55:06,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 16:55:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-12-03 16:55:06,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-12-03 16:55:06,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:06,298 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-12-03 16:55:06,298 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:06,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:06,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1868332362, now seen corresponding path program 65 times [2018-12-03 16:55:06,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:06,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:06,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:06,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:06,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:08,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:08,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:08,611 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:08,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:08,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:08,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:08,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:08,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:08,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 16:55:08,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:08,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:08,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:13,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:13,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 16:55:13,578 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:13,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:55:13,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:55:13,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:55:13,580 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 68 states. [2018-12-03 16:55:13,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:13,791 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-12-03 16:55:13,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:55:13,792 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 266 [2018-12-03 16:55:13,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:13,793 INFO L225 Difference]: With dead ends: 273 [2018-12-03 16:55:13,794 INFO L226 Difference]: Without dead ends: 271 [2018-12-03 16:55:13,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:55:13,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-12-03 16:55:13,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-12-03 16:55:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-03 16:55:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-12-03 16:55:13,798 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 266 [2018-12-03 16:55:13,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:13,798 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-12-03 16:55:13,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:55:13,798 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-12-03 16:55:13,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-12-03 16:55:13,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:13,800 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-12-03 16:55:13,800 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:13,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:13,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1687648928, now seen corresponding path program 66 times [2018-12-03 16:55:13,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:13,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:13,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:13,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:13,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:15,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:15,608 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:15,608 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:15,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:15,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:15,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:15,616 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:15,617 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:15,669 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:15,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:15,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:15,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:20,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:20,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 16:55:20,638 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:20,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:55:20,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:55:20,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:55:20,640 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 69 states. [2018-12-03 16:55:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:20,812 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-12-03 16:55:20,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:55:20,813 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 270 [2018-12-03 16:55:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:20,814 INFO L225 Difference]: With dead ends: 277 [2018-12-03 16:55:20,814 INFO L226 Difference]: Without dead ends: 275 [2018-12-03 16:55:20,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:55:20,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-03 16:55:20,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-12-03 16:55:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-12-03 16:55:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-12-03 16:55:20,818 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 270 [2018-12-03 16:55:20,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:20,818 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-12-03 16:55:20,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:55:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-12-03 16:55:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-12-03 16:55:20,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:20,820 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-12-03 16:55:20,820 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:20,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:20,821 INFO L82 PathProgramCache]: Analyzing trace with hash -516414710, now seen corresponding path program 67 times [2018-12-03 16:55:20,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:20,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:20,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:20,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:20,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:22,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:22,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:22,699 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:22,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:22,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:22,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:22,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:22,708 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:22,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:22,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:27,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:27,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 16:55:27,974 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:27,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:55:27,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:55:27,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:55:27,976 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 70 states. [2018-12-03 16:55:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:28,148 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-12-03 16:55:28,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:55:28,149 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 274 [2018-12-03 16:55:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:28,150 INFO L225 Difference]: With dead ends: 281 [2018-12-03 16:55:28,150 INFO L226 Difference]: Without dead ends: 279 [2018-12-03 16:55:28,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:55:28,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-03 16:55:28,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-12-03 16:55:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-12-03 16:55:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-12-03 16:55:28,153 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 274 [2018-12-03 16:55:28,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:28,154 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-12-03 16:55:28,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:55:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-12-03 16:55:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-12-03 16:55:28,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:28,155 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-12-03 16:55:28,156 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:28,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:28,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1431100340, now seen corresponding path program 68 times [2018-12-03 16:55:28,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:28,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:28,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:28,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:28,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:29,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:29,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:29,986 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:29,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:29,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:29,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:29,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:29,996 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:30,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-03 16:55:30,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:30,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:30,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:35,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:35,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 16:55:35,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:35,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 16:55:35,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 16:55:35,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:55:35,344 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 71 states. [2018-12-03 16:55:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:35,594 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-12-03 16:55:35,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:55:35,594 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 278 [2018-12-03 16:55:35,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:35,596 INFO L225 Difference]: With dead ends: 285 [2018-12-03 16:55:35,596 INFO L226 Difference]: Without dead ends: 283 [2018-12-03 16:55:35,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:55:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-03 16:55:35,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-12-03 16:55:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-03 16:55:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-12-03 16:55:35,599 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 278 [2018-12-03 16:55:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:35,599 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-12-03 16:55:35,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 16:55:35,600 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-12-03 16:55:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-03 16:55:35,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:35,601 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-12-03 16:55:35,601 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:35,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:35,601 INFO L82 PathProgramCache]: Analyzing trace with hash -912183458, now seen corresponding path program 69 times [2018-12-03 16:55:35,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:35,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:35,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:35,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:35,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:37,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:37,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:37,958 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:37,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:37,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:37,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:37,967 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:37,967 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:38,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:38,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:38,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:38,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:43,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:43,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 16:55:43,435 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:43,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:55:43,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:55:43,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:55:43,437 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 72 states. [2018-12-03 16:55:43,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:43,598 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-12-03 16:55:43,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:55:43,598 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 282 [2018-12-03 16:55:43,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:43,599 INFO L225 Difference]: With dead ends: 289 [2018-12-03 16:55:43,599 INFO L226 Difference]: Without dead ends: 287 [2018-12-03 16:55:43,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:55:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-03 16:55:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-12-03 16:55:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-12-03 16:55:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-12-03 16:55:43,603 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 282 [2018-12-03 16:55:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:43,603 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-12-03 16:55:43,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:55:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-12-03 16:55:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-03 16:55:43,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:43,605 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-12-03 16:55:43,605 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:43,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:43,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1896899064, now seen corresponding path program 70 times [2018-12-03 16:55:43,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:43,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:43,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:43,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:43,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:45,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:45,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:45,545 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:45,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:45,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:45,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:45,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:45,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:45,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:45,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:45,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:51,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:51,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 16:55:51,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:51,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 16:55:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 16:55:51,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:55:51,253 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 73 states. [2018-12-03 16:55:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:51,495 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-12-03 16:55:51,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:55:51,495 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 286 [2018-12-03 16:55:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:51,497 INFO L225 Difference]: With dead ends: 293 [2018-12-03 16:55:51,497 INFO L226 Difference]: Without dead ends: 291 [2018-12-03 16:55:51,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:55:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-03 16:55:51,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-12-03 16:55:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-03 16:55:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-12-03 16:55:51,502 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 286 [2018-12-03 16:55:51,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:51,502 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-12-03 16:55:51,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 16:55:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-12-03 16:55:51,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-12-03 16:55:51,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:51,504 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-12-03 16:55:51,504 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:51,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:51,504 INFO L82 PathProgramCache]: Analyzing trace with hash 347252658, now seen corresponding path program 71 times [2018-12-03 16:55:51,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:51,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:51,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:51,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:51,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:53,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:53,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:53,692 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:53,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 16:55:53,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:53,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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:53,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:53,701 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:53,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-12-03 16:55:53,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:53,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:53,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:59,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:59,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 16:55:59,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:59,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:55:59,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:55:59,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:55:59,534 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 74 states. [2018-12-03 16:55:59,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:59,797 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-12-03 16:55:59,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:55:59,797 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 290 [2018-12-03 16:55:59,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:59,799 INFO L225 Difference]: With dead ends: 297 [2018-12-03 16:55:59,799 INFO L226 Difference]: Without dead ends: 295 [2018-12-03 16:55:59,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:55:59,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-03 16:55:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-12-03 16:55:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-12-03 16:55:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-12-03 16:55:59,804 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 290 [2018-12-03 16:55:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:59,804 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-12-03 16:55:59,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:55:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-12-03 16:55:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-12-03 16:55:59,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:59,806 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-12-03 16:55:59,806 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:59,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:59,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1994077092, now seen corresponding path program 72 times [2018-12-03 16:55:59,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:59,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:59,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:59,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:59,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:01,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:01,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:01,795 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:01,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:01,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:01,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:01,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:01,806 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:01,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:01,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:01,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:01,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:07,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:07,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 16:56:07,913 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:07,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:56:07,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:56:07,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:56:07,915 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 75 states. [2018-12-03 16:56:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:08,079 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-12-03 16:56:08,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:56:08,079 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 294 [2018-12-03 16:56:08,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:08,080 INFO L225 Difference]: With dead ends: 301 [2018-12-03 16:56:08,080 INFO L226 Difference]: Without dead ends: 299 [2018-12-03 16:56:08,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:56:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-12-03 16:56:08,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-12-03 16:56:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-12-03 16:56:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-12-03 16:56:08,085 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 294 [2018-12-03 16:56:08,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:08,085 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-12-03 16:56:08,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:56:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-12-03 16:56:08,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-12-03 16:56:08,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:08,087 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-12-03 16:56:08,087 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:08,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:08,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2034273286, now seen corresponding path program 73 times [2018-12-03 16:56:08,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:08,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:08,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:08,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:08,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:10,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:10,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:10,115 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:10,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:10,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:10,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:10,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:10,123 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:10,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:10,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:16,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:16,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 16:56:16,378 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:16,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:56:16,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:56:16,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:56:16,380 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 76 states. [2018-12-03 16:56:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:16,645 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-12-03 16:56:16,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:56:16,646 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 298 [2018-12-03 16:56:16,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:16,648 INFO L225 Difference]: With dead ends: 305 [2018-12-03 16:56:16,648 INFO L226 Difference]: Without dead ends: 303 [2018-12-03 16:56:16,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:56:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-03 16:56:16,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-12-03 16:56:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-12-03 16:56:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-12-03 16:56:16,652 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 298 [2018-12-03 16:56:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:16,652 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-12-03 16:56:16,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:56:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-12-03 16:56:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-12-03 16:56:16,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:16,653 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-12-03 16:56:16,653 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:16,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:16,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1891657392, now seen corresponding path program 74 times [2018-12-03 16:56:16,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:16,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:16,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:16,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:16,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:18,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:18,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:18,971 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:18,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:18,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:18,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:18,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:18,980 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:19,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2018-12-03 16:56:19,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:19,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:19,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:25,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:25,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 16:56:25,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:25,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 16:56:25,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 16:56:25,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:56:25,343 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 77 states. [2018-12-03 16:56:25,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:25,635 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-12-03 16:56:25,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:56:25,636 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 302 [2018-12-03 16:56:25,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:25,638 INFO L225 Difference]: With dead ends: 309 [2018-12-03 16:56:25,638 INFO L226 Difference]: Without dead ends: 307 [2018-12-03 16:56:25,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:56:25,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-03 16:56:25,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-12-03 16:56:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-12-03 16:56:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-12-03 16:56:25,641 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 302 [2018-12-03 16:56:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:25,642 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-12-03 16:56:25,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 16:56:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-12-03 16:56:25,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-12-03 16:56:25,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:25,643 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 1, 1, 1, 1, 1, 1] [2018-12-03 16:56:25,643 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:25,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:25,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1709253542, now seen corresponding path program 75 times [2018-12-03 16:56:25,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:25,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:25,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:25,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:25,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:28,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:28,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:28,151 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:28,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:28,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:28,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:28,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:28,161 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:28,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:28,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:28,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:28,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:34,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:34,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 16:56:34,794 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:34,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:56:34,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:56:34,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:56:34,795 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 78 states. [2018-12-03 16:56:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:35,080 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-12-03 16:56:35,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:56:35,081 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 306 [2018-12-03 16:56:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:35,083 INFO L225 Difference]: With dead ends: 313 [2018-12-03 16:56:35,083 INFO L226 Difference]: Without dead ends: 311 [2018-12-03 16:56:35,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:56:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-12-03 16:56:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-12-03 16:56:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-12-03 16:56:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-12-03 16:56:35,087 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 306 [2018-12-03 16:56:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:35,087 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-12-03 16:56:35,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:56:35,087 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-12-03 16:56:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-12-03 16:56:35,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:35,089 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 76, 1, 1, 1, 1, 1, 1] [2018-12-03 16:56:35,089 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:35,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:35,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1586916612, now seen corresponding path program 76 times [2018-12-03 16:56:35,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:35,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:35,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:35,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:35,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:37,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:37,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:37,295 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:37,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:37,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:37,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:37,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:37,304 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:37,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:37,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:44,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:44,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 16:56:44,229 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:44,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 16:56:44,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 16:56:44,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:56:44,230 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 79 states. [2018-12-03 16:56:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:44,408 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-12-03 16:56:44,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:56:44,408 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 310 [2018-12-03 16:56:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:44,409 INFO L225 Difference]: With dead ends: 317 [2018-12-03 16:56:44,409 INFO L226 Difference]: Without dead ends: 315 [2018-12-03 16:56:44,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:56:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-03 16:56:44,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-12-03 16:56:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-03 16:56:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-12-03 16:56:44,413 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 310 [2018-12-03 16:56:44,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:44,413 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-12-03 16:56:44,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 16:56:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-12-03 16:56:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-12-03 16:56:44,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:44,414 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 77, 1, 1, 1, 1, 1, 1] [2018-12-03 16:56:44,414 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:44,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash 102865070, now seen corresponding path program 77 times [2018-12-03 16:56:44,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:44,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:44,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:44,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:44,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:46,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:46,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:46,691 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:46,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:46,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:46,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:46,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:46,700 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:46,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2018-12-03 16:56:46,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:46,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:46,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:53,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:53,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 16:56:53,715 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:53,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:56:53,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:56:53,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:56:53,717 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 80 states. [2018-12-03 16:56:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:54,026 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-12-03 16:56:54,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:56:54,026 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 314 [2018-12-03 16:56:54,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:54,028 INFO L225 Difference]: With dead ends: 321 [2018-12-03 16:56:54,028 INFO L226 Difference]: Without dead ends: 319 [2018-12-03 16:56:54,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:56:54,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-03 16:56:54,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-12-03 16:56:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-12-03 16:56:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-12-03 16:56:54,032 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 314 [2018-12-03 16:56:54,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:54,032 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-12-03 16:56:54,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:56:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-12-03 16:56:54,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-12-03 16:56:54,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:54,034 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 1, 1, 1, 1, 1, 1] [2018-12-03 16:56:54,034 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:54,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:54,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1467670360, now seen corresponding path program 78 times [2018-12-03 16:56:54,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:54,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:54,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:54,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:54,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:56,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:56,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:56,301 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:56,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:56,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:56,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:56,311 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:56,311 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:56,375 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:56,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:56,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:56,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:03,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:03,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 16:57:03,337 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:03,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 16:57:03,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 16:57:03,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:57:03,339 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 81 states. [2018-12-03 16:57:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:04,205 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-12-03 16:57:04,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:57:04,205 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 318 [2018-12-03 16:57:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:04,207 INFO L225 Difference]: With dead ends: 325 [2018-12-03 16:57:04,207 INFO L226 Difference]: Without dead ends: 323 [2018-12-03 16:57:04,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:57:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-12-03 16:57:04,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-12-03 16:57:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-12-03 16:57:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-12-03 16:57:04,211 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 318 [2018-12-03 16:57:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:04,212 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-12-03 16:57:04,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 16:57:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-12-03 16:57:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-12-03 16:57:04,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:04,213 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 79, 1, 1, 1, 1, 1, 1] [2018-12-03 16:57:04,214 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:04,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:04,214 INFO L82 PathProgramCache]: Analyzing trace with hash 941408514, now seen corresponding path program 79 times [2018-12-03 16:57:04,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:04,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:04,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:04,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:04,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:06,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:06,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:06,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:06,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:06,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:06,612 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:06,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:06,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:06,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:06,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:13,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:13,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 16:57:13,993 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:13,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 16:57:13,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 16:57:13,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:57:13,995 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 82 states. [2018-12-03 16:57:14,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:14,343 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-12-03 16:57:14,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 16:57:14,343 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 322 [2018-12-03 16:57:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:14,344 INFO L225 Difference]: With dead ends: 329 [2018-12-03 16:57:14,344 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 16:57:14,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:57:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 16:57:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-12-03 16:57:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-12-03 16:57:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2018-12-03 16:57:14,348 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 322 [2018-12-03 16:57:14,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:14,348 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2018-12-03 16:57:14,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 16:57:14,348 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2018-12-03 16:57:14,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-12-03 16:57:14,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:14,350 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 80, 1, 1, 1, 1, 1, 1] [2018-12-03 16:57:14,350 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:14,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:14,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1279376812, now seen corresponding path program 80 times [2018-12-03 16:57:14,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:14,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:14,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:14,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:14,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:16,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:16,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:16,721 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:16,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:16,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:16,721 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:16,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:16,729 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:16,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-12-03 16:57:16,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:16,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:16,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:24,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:24,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 16:57:24,339 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:24,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 16:57:24,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 16:57:24,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:57:24,341 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 83 states. [2018-12-03 16:57:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:24,601 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-12-03 16:57:24,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 16:57:24,601 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 326 [2018-12-03 16:57:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:24,603 INFO L225 Difference]: With dead ends: 333 [2018-12-03 16:57:24,603 INFO L226 Difference]: Without dead ends: 331 [2018-12-03 16:57:24,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:57:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-03 16:57:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-12-03 16:57:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-12-03 16:57:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-12-03 16:57:24,606 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 326 [2018-12-03 16:57:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:24,606 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-12-03 16:57:24,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 16:57:24,606 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-12-03 16:57:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-12-03 16:57:24,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:24,608 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 81, 1, 1, 1, 1, 1, 1] [2018-12-03 16:57:24,608 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:24,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:24,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1763420842, now seen corresponding path program 81 times [2018-12-03 16:57:24,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:24,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:24,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:24,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:24,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:27,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:27,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:27,061 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:27,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:27,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:27,062 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:27,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:27,071 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:27,136 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:27,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:27,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:27,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:34,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:34,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 16:57:34,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:34,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 16:57:34,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 16:57:34,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:57:34,795 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 84 states. [2018-12-03 16:57:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:35,065 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-12-03 16:57:35,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 16:57:35,066 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 330 [2018-12-03 16:57:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:35,067 INFO L225 Difference]: With dead ends: 337 [2018-12-03 16:57:35,067 INFO L226 Difference]: Without dead ends: 335 [2018-12-03 16:57:35,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:57:35,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-12-03 16:57:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-12-03 16:57:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-03 16:57:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-12-03 16:57:35,071 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 330 [2018-12-03 16:57:35,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:35,071 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-12-03 16:57:35,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 16:57:35,071 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-12-03 16:57:35,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-12-03 16:57:35,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:35,073 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 82, 1, 1, 1, 1, 1, 1] [2018-12-03 16:57:35,073 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:35,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:35,073 INFO L82 PathProgramCache]: Analyzing trace with hash 431949824, now seen corresponding path program 82 times [2018-12-03 16:57:35,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:35,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:35,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:35,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:35,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:37,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:37,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:37,646 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:37,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 16:57:37,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:37,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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:37,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:37,656 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:37,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:37,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:37,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:45,431 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:45,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:45,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 16:57:45,450 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:45,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 16:57:45,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 16:57:45,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:57:45,452 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 85 states. [2018-12-03 16:57:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:45,710 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-12-03 16:57:45,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 16:57:45,710 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 334 [2018-12-03 16:57:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:45,712 INFO L225 Difference]: With dead ends: 341 [2018-12-03 16:57:45,712 INFO L226 Difference]: Without dead ends: 339 [2018-12-03 16:57:45,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:57:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-03 16:57:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-12-03 16:57:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-12-03 16:57:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-12-03 16:57:45,716 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 334 [2018-12-03 16:57:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:45,716 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-12-03 16:57:45,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 16:57:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-12-03 16:57:45,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-12-03 16:57:45,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:45,718 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 83, 1, 1, 1, 1, 1, 1] [2018-12-03 16:57:45,718 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:45,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:45,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1967936938, now seen corresponding path program 83 times [2018-12-03 16:57:45,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:45,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:45,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:45,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:45,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:48,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:48,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:48,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:48,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:48,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:48,302 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:48,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:48,311 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:48,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-12-03 16:57:48,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:48,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:48,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:56,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:56,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 16:57:56,458 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:56,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 16:57:56,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 16:57:56,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:57:56,460 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 86 states. [2018-12-03 16:57:56,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:56,713 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-12-03 16:57:56,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 16:57:56,714 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 338 [2018-12-03 16:57:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:56,715 INFO L225 Difference]: With dead ends: 345 [2018-12-03 16:57:56,715 INFO L226 Difference]: Without dead ends: 343 [2018-12-03 16:57:56,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:57:56,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-12-03 16:57:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-12-03 16:57:56,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-12-03 16:57:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-12-03 16:57:56,719 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 338 [2018-12-03 16:57:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:56,719 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-12-03 16:57:56,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 16:57:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-12-03 16:57:56,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-12-03 16:57:56,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:56,722 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 84, 1, 1, 1, 1, 1, 1] [2018-12-03 16:57:56,722 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:56,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:56,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2000241068, now seen corresponding path program 84 times [2018-12-03 16:57:56,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:56,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:56,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:56,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:56,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:59,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:59,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:59,424 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:59,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:59,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:59,424 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:59,433 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:59,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:59,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:59,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:59,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:59,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:07,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:07,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 16:58:07,770 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:07,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 16:58:07,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 16:58:07,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:58:07,773 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 87 states. [2018-12-03 16:58:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:08,201 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-12-03 16:58:08,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 16:58:08,202 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 342 [2018-12-03 16:58:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:08,204 INFO L225 Difference]: With dead ends: 349 [2018-12-03 16:58:08,204 INFO L226 Difference]: Without dead ends: 347 [2018-12-03 16:58:08,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:58:08,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-12-03 16:58:08,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-12-03 16:58:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-12-03 16:58:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-12-03 16:58:08,209 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 342 [2018-12-03 16:58:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:08,209 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-12-03 16:58:08,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 16:58:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-12-03 16:58:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-12-03 16:58:08,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:08,211 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 85, 1, 1, 1, 1, 1, 1] [2018-12-03 16:58:08,211 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:08,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash 304660990, now seen corresponding path program 85 times [2018-12-03 16:58:08,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:08,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:08,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:08,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:08,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:11,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:11,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:11,198 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:11,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:11,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:11,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:11,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:11,210 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:11,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:11,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:19,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:19,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 16:58:19,422 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:19,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:58:19,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:58:19,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:58:19,424 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 88 states. [2018-12-03 16:58:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:19,878 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-12-03 16:58:19,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 16:58:19,879 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 346 [2018-12-03 16:58:19,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:19,881 INFO L225 Difference]: With dead ends: 353 [2018-12-03 16:58:19,881 INFO L226 Difference]: Without dead ends: 351 [2018-12-03 16:58:19,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:58:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-03 16:58:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-12-03 16:58:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-12-03 16:58:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2018-12-03 16:58:19,885 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 346 [2018-12-03 16:58:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:19,886 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2018-12-03 16:58:19,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:58:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2018-12-03 16:58:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-12-03 16:58:19,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:19,887 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 86, 86, 1, 1, 1, 1, 1, 1] [2018-12-03 16:58:19,887 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:19,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:19,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1311563944, now seen corresponding path program 86 times [2018-12-03 16:58:19,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:19,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:19,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:19,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:19,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:22,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:22,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:22,980 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:22,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:22,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:22,980 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:22,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:22,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:23,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-12-03 16:58:23,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:23,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:23,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:31,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:31,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 16:58:31,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:31,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 16:58:31,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 16:58:31,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:58:31,745 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 89 states. [2018-12-03 16:58:32,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:32,219 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-12-03 16:58:32,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 16:58:32,220 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 350 [2018-12-03 16:58:32,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:32,222 INFO L225 Difference]: With dead ends: 357 [2018-12-03 16:58:32,222 INFO L226 Difference]: Without dead ends: 355 [2018-12-03 16:58:32,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 612 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:58:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-12-03 16:58:32,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-12-03 16:58:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-12-03 16:58:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2018-12-03 16:58:32,226 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 350 [2018-12-03 16:58:32,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:32,226 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2018-12-03 16:58:32,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 16:58:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2018-12-03 16:58:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-12-03 16:58:32,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:32,228 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 87, 87, 1, 1, 1, 1, 1, 1] [2018-12-03 16:58:32,228 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:32,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:32,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1739744686, now seen corresponding path program 87 times [2018-12-03 16:58:32,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:32,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:32,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:32,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:32,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:35,019 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:35,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:35,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:35,019 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:35,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:35,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:35,020 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:35,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:35,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:35,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:35,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:35,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:35,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:43,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:43,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 16:58:43,811 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:43,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 16:58:43,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 16:58:43,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:58:43,813 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 90 states. [2018-12-03 16:58:44,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:44,388 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2018-12-03 16:58:44,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 16:58:44,388 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 354 [2018-12-03 16:58:44,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:44,390 INFO L225 Difference]: With dead ends: 361 [2018-12-03 16:58:44,390 INFO L226 Difference]: Without dead ends: 359 [2018-12-03 16:58:44,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 795 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:58:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-12-03 16:58:44,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-12-03 16:58:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-03 16:58:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2018-12-03 16:58:44,394 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 354 [2018-12-03 16:58:44,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:44,394 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2018-12-03 16:58:44,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 16:58:44,394 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2018-12-03 16:58:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-12-03 16:58:44,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:44,396 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 88, 88, 1, 1, 1, 1, 1, 1] [2018-12-03 16:58:44,396 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:44,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:44,396 INFO L82 PathProgramCache]: Analyzing trace with hash 180711164, now seen corresponding path program 88 times [2018-12-03 16:58:44,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:44,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:44,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:44,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:44,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:47,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:47,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:47,639 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:47,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:47,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:47,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:47,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:47,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:47,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:47,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:56,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:56,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 16:58:56,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:56,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 16:58:56,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 16:58:56,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:58:56,602 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand 91 states. [2018-12-03 16:58:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:56,992 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-12-03 16:58:56,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 16:58:56,993 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 358 [2018-12-03 16:58:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:56,995 INFO L225 Difference]: With dead ends: 365 [2018-12-03 16:58:56,995 INFO L226 Difference]: Without dead ends: 363 [2018-12-03 16:58:56,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 626 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:58:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-12-03 16:58:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-12-03 16:58:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-12-03 16:58:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-12-03 16:58:57,000 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 358 [2018-12-03 16:58:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:57,000 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-12-03 16:58:57,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 16:58:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-12-03 16:58:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-12-03 16:58:57,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:57,002 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 89, 89, 1, 1, 1, 1, 1, 1] [2018-12-03 16:58:57,002 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:57,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:57,002 INFO L82 PathProgramCache]: Analyzing trace with hash 512679590, now seen corresponding path program 89 times [2018-12-03 16:58:57,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:57,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:57,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:57,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:57,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:59,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:59,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:59,956 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:59,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:59,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:59,956 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:59,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:59,965 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:00,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2018-12-03 16:59:00,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:00,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:00,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:09,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:09,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 16:59:09,332 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:09,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 16:59:09,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 16:59:09,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:59:09,334 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 92 states. [2018-12-03 16:59:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:09,605 INFO L93 Difference]: Finished difference Result 369 states and 369 transitions. [2018-12-03 16:59:09,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 16:59:09,606 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 362 [2018-12-03 16:59:09,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:09,607 INFO L225 Difference]: With dead ends: 369 [2018-12-03 16:59:09,607 INFO L226 Difference]: Without dead ends: 367 [2018-12-03 16:59:09,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:59:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-12-03 16:59:09,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-12-03 16:59:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-03 16:59:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-12-03 16:59:09,611 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 362 [2018-12-03 16:59:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:09,611 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-12-03 16:59:09,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 16:59:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-12-03 16:59:09,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-12-03 16:59:09,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:09,613 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 90, 90, 1, 1, 1, 1, 1, 1] [2018-12-03 16:59:09,613 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:09,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:09,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1264871760, now seen corresponding path program 90 times [2018-12-03 16:59:09,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:09,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:09,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:09,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:09,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:12,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:12,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:12,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:12,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:12,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:12,977 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:12,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:12,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:13,059 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:13,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:13,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:13,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:22,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:22,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 16:59:22,324 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:22,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 16:59:22,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 16:59:22,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:59:22,326 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 93 states. [2018-12-03 16:59:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:22,665 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-12-03 16:59:22,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 16:59:22,666 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 366 [2018-12-03 16:59:22,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:22,667 INFO L225 Difference]: With dead ends: 373 [2018-12-03 16:59:22,667 INFO L226 Difference]: Without dead ends: 371 [2018-12-03 16:59:22,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 822 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:59:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-12-03 16:59:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-12-03 16:59:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-12-03 16:59:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-12-03 16:59:22,671 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 366 [2018-12-03 16:59:22,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:22,671 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-12-03 16:59:22,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 16:59:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-12-03 16:59:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-12-03 16:59:22,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:22,672 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 91, 91, 1, 1, 1, 1, 1, 1] [2018-12-03 16:59:22,673 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:22,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:22,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1480552710, now seen corresponding path program 91 times [2018-12-03 16:59:22,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:22,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:22,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:25,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:25,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:25,844 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:25,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 16:59:25,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:25,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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:25,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:25,855 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:25,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:26,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:35,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:35,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 16:59:35,338 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:35,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 16:59:35,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 16:59:35,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 16:59:35,340 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 94 states. [2018-12-03 16:59:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:35,865 INFO L93 Difference]: Finished difference Result 377 states and 377 transitions. [2018-12-03 16:59:35,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 16:59:35,865 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 370 [2018-12-03 16:59:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:35,867 INFO L225 Difference]: With dead ends: 377 [2018-12-03 16:59:35,868 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 16:59:35,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 16:59:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 16:59:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2018-12-03 16:59:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-12-03 16:59:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 375 transitions. [2018-12-03 16:59:35,872 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 375 transitions. Word has length 370 [2018-12-03 16:59:35,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:35,872 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 375 transitions. [2018-12-03 16:59:35,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 16:59:35,872 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 375 transitions. [2018-12-03 16:59:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-12-03 16:59:35,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:35,873 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 92, 92, 1, 1, 1, 1, 1, 1] [2018-12-03 16:59:35,874 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:35,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1998729308, now seen corresponding path program 92 times [2018-12-03 16:59:35,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:35,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:35,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:35,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:35,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:39,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:39,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:39,312 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:39,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:39,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:39,312 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:39,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:39,321 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:39,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-12-03 16:59:39,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:39,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:39,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:49,311 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:49,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:49,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 16:59:49,332 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:49,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 16:59:49,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 16:59:49,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:59:49,334 INFO L87 Difference]: Start difference. First operand 375 states and 375 transitions. Second operand 95 states. [2018-12-03 16:59:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:49,686 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2018-12-03 16:59:49,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 16:59:49,687 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 374 [2018-12-03 16:59:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:49,689 INFO L225 Difference]: With dead ends: 381 [2018-12-03 16:59:49,689 INFO L226 Difference]: Without dead ends: 379 [2018-12-03 16:59:49,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:59:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-12-03 16:59:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-12-03 16:59:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-12-03 16:59:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 379 transitions. [2018-12-03 16:59:49,693 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 379 transitions. Word has length 374 [2018-12-03 16:59:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:49,694 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 379 transitions. [2018-12-03 16:59:49,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 16:59:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 379 transitions. [2018-12-03 16:59:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-12-03 16:59:49,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:49,695 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 93, 93, 1, 1, 1, 1, 1, 1] [2018-12-03 16:59:49,695 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:49,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:49,696 INFO L82 PathProgramCache]: Analyzing trace with hash 582396750, now seen corresponding path program 93 times [2018-12-03 16:59:49,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:49,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:49,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:49,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:49,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:53,190 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:53,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:53,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:53,191 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:53,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:53,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:53,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:53,200 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:53,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:53,270 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:53,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:53,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:53,374 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:53,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:03,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:03,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 17:00:03,333 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:03,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 17:00:03,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 17:00:03,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:00:03,336 INFO L87 Difference]: Start difference. First operand 379 states and 379 transitions. Second operand 96 states. [2018-12-03 17:00:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:03,657 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-12-03 17:00:03,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 17:00:03,658 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 378 [2018-12-03 17:00:03,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:03,660 INFO L225 Difference]: With dead ends: 385 [2018-12-03 17:00:03,660 INFO L226 Difference]: Without dead ends: 383 [2018-12-03 17:00:03,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 849 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:00:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-12-03 17:00:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-12-03 17:00:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-12-03 17:00:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-12-03 17:00:03,665 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 378 [2018-12-03 17:00:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:03,666 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-12-03 17:00:03,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 17:00:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-12-03 17:00:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-12-03 17:00:03,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:03,668 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 94, 94, 1, 1, 1, 1, 1, 1] [2018-12-03 17:00:03,668 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:03,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:03,668 INFO L82 PathProgramCache]: Analyzing trace with hash 671457784, now seen corresponding path program 94 times [2018-12-03 17:00:03,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:03,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:03,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:03,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:03,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:06,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:06,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:06,924 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:06,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:06,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:06,925 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:06,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:06,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:07,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:07,127 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:07,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:16,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:16,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 17:00:16,932 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:16,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 17:00:16,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 17:00:16,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:00:16,934 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 97 states. [2018-12-03 17:00:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:17,375 INFO L93 Difference]: Finished difference Result 389 states and 389 transitions. [2018-12-03 17:00:17,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 17:00:17,375 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 382 [2018-12-03 17:00:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:17,378 INFO L225 Difference]: With dead ends: 389 [2018-12-03 17:00:17,378 INFO L226 Difference]: Without dead ends: 387 [2018-12-03 17:00:17,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 858 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:00:17,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-12-03 17:00:17,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-12-03 17:00:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-12-03 17:00:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2018-12-03 17:00:17,383 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 382 [2018-12-03 17:00:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:17,383 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2018-12-03 17:00:17,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 17:00:17,383 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2018-12-03 17:00:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-12-03 17:00:17,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:17,384 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 95, 95, 1, 1, 1, 1, 1, 1] [2018-12-03 17:00:17,385 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:17,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:17,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1782920098, now seen corresponding path program 95 times [2018-12-03 17:00:17,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:17,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:17,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:17,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:17,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:21,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:21,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:21,021 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:21,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:21,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:21,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:21,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:21,032 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:21,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2018-12-03 17:00:21,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:21,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:21,312 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:21,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:31,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:31,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 17:00:31,515 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:31,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 17:00:31,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 17:00:31,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:00:31,517 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 98 states. [2018-12-03 17:00:32,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:32,117 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-12-03 17:00:32,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 17:00:32,117 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 386 [2018-12-03 17:00:32,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:32,119 INFO L225 Difference]: With dead ends: 393 [2018-12-03 17:00:32,120 INFO L226 Difference]: Without dead ends: 391 [2018-12-03 17:00:32,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:00:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-12-03 17:00:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2018-12-03 17:00:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-12-03 17:00:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2018-12-03 17:00:32,124 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 386 [2018-12-03 17:00:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:32,124 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2018-12-03 17:00:32,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 17:00:32,124 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2018-12-03 17:00:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-12-03 17:00:32,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:32,126 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 96, 96, 1, 1, 1, 1, 1, 1] [2018-12-03 17:00:32,126 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:32,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:32,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2041569356, now seen corresponding path program 96 times [2018-12-03 17:00:32,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:32,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:32,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:32,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:32,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:35,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:35,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:35,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:35,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:35,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:35,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:35,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:35,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:35,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:35,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:35,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:36,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:46,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:46,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 17:00:46,436 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:46,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 17:00:46,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 17:00:46,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:00:46,438 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 99 states. [2018-12-03 17:00:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:47,022 INFO L93 Difference]: Finished difference Result 397 states and 397 transitions. [2018-12-03 17:00:47,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 17:00:47,023 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 390 [2018-12-03 17:00:47,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:47,025 INFO L225 Difference]: With dead ends: 397 [2018-12-03 17:00:47,026 INFO L226 Difference]: Without dead ends: 395 [2018-12-03 17:00:47,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 682 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:00:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-12-03 17:00:47,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-12-03 17:00:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-12-03 17:00:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-12-03 17:00:47,030 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 390 [2018-12-03 17:00:47,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:47,030 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-12-03 17:00:47,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 17:00:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-12-03 17:00:47,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-12-03 17:00:47,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:47,032 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 97, 97, 1, 1, 1, 1, 1, 1] [2018-12-03 17:00:47,032 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:47,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:47,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1161832438, now seen corresponding path program 97 times [2018-12-03 17:00:47,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:47,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:47,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:47,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:47,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:50,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:50,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:50,884 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:50,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:50,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:50,885 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:50,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:50,893 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:50,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:51,079 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:51,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:01,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:01,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 17:01:01,707 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:01,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 17:01:01,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 17:01:01,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:01:01,710 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 100 states. [2018-12-03 17:01:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:02,273 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-12-03 17:01:02,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 17:01:02,274 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 394 [2018-12-03 17:01:02,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:02,276 INFO L225 Difference]: With dead ends: 401 [2018-12-03 17:01:02,276 INFO L226 Difference]: Without dead ends: 399 [2018-12-03 17:01:02,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 689 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:01:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-12-03 17:01:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-12-03 17:01:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-03 17:01:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 399 transitions. [2018-12-03 17:01:02,281 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 399 transitions. Word has length 394 [2018-12-03 17:01:02,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:02,281 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 399 transitions. [2018-12-03 17:01:02,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 17:01:02,282 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 399 transitions. [2018-12-03 17:01:02,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-12-03 17:01:02,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:02,283 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 98, 98, 1, 1, 1, 1, 1, 1] [2018-12-03 17:01:02,283 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:02,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:02,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1162835296, now seen corresponding path program 98 times [2018-12-03 17:01:02,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:02,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:02,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:02,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:02,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:06,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:06,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:06,170 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:06,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:06,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:06,170 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:06,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:06,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:06,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2018-12-03 17:01:06,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:06,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:06,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:17,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:17,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 17:01:17,293 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:17,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 17:01:17,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 17:01:17,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:01:17,295 INFO L87 Difference]: Start difference. First operand 399 states and 399 transitions. Second operand 101 states. [2018-12-03 17:01:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:17,998 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2018-12-03 17:01:17,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 17:01:17,999 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 398 [2018-12-03 17:01:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:18,001 INFO L225 Difference]: With dead ends: 405 [2018-12-03 17:01:18,001 INFO L226 Difference]: Without dead ends: 403 [2018-12-03 17:01:18,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 894 GetRequests, 696 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:01:18,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-12-03 17:01:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-12-03 17:01:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-12-03 17:01:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-12-03 17:01:18,007 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 398 [2018-12-03 17:01:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:18,008 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-12-03 17:01:18,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 17:01:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-12-03 17:01:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-12-03 17:01:18,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:18,010 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 99, 99, 1, 1, 1, 1, 1, 1] [2018-12-03 17:01:18,010 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:18,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:18,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1719371850, now seen corresponding path program 99 times [2018-12-03 17:01:18,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:18,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:18,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:18,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:18,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:21,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:21,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:21,960 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:21,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:21,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:21,961 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:21,972 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:21,973 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:22,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:22,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:22,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:22,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:33,236 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:33,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:33,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 17:01:33,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:33,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 17:01:33,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 17:01:33,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:01:33,258 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 102 states. [2018-12-03 17:01:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:33,614 INFO L93 Difference]: Finished difference Result 409 states and 409 transitions. [2018-12-03 17:01:33,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 17:01:33,614 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 402 [2018-12-03 17:01:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:33,616 INFO L225 Difference]: With dead ends: 409 [2018-12-03 17:01:33,616 INFO L226 Difference]: Without dead ends: 407 [2018-12-03 17:01:33,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 903 GetRequests, 703 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:01:33,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-12-03 17:01:33,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2018-12-03 17:01:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-12-03 17:01:33,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2018-12-03 17:01:33,622 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 402 [2018-12-03 17:01:33,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:33,622 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2018-12-03 17:01:33,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 17:01:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2018-12-03 17:01:33,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-12-03 17:01:33,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:33,624 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 100, 100, 1, 1, 1, 1, 1, 1] [2018-12-03 17:01:33,625 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:33,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:33,625 INFO L82 PathProgramCache]: Analyzing trace with hash 333160692, now seen corresponding path program 100 times [2018-12-03 17:01:33,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:33,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:33,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:33,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:33,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:37,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:37,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:37,598 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:37,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:37,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:37,598 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:37,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:37,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:37,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:37,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:48,975 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:48,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:48,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 17:01:48,995 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:48,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 17:01:48,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 17:01:48,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:01:48,997 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 103 states. [2018-12-03 17:01:49,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:49,561 INFO L93 Difference]: Finished difference Result 413 states and 413 transitions. [2018-12-03 17:01:49,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 17:01:49,562 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 406 [2018-12-03 17:01:49,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:49,564 INFO L225 Difference]: With dead ends: 413 [2018-12-03 17:01:49,564 INFO L226 Difference]: Without dead ends: 411 [2018-12-03 17:01:49,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:01:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-12-03 17:01:49,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-12-03 17:01:49,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-03 17:01:49,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2018-12-03 17:01:49,572 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 406 [2018-12-03 17:01:49,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:49,572 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2018-12-03 17:01:49,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 17:01:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2018-12-03 17:01:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-12-03 17:01:49,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:49,574 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 101, 101, 1, 1, 1, 1, 1, 1] [2018-12-03 17:01:49,574 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:49,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:49,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1825264798, now seen corresponding path program 101 times [2018-12-03 17:01:49,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:49,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:49,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:49,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:49,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:53,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:53,712 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:53,712 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:53,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:53,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:53,712 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:53,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:53,720 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:53,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) [2018-12-03 17:01:53,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:53,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:54,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:05,577 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:05,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:05,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 17:02:05,596 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:05,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 17:02:05,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 17:02:05,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:02:05,599 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 104 states. [2018-12-03 17:02:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:06,019 INFO L93 Difference]: Finished difference Result 417 states and 417 transitions. [2018-12-03 17:02:06,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 17:02:06,019 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 410 [2018-12-03 17:02:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:06,020 INFO L225 Difference]: With dead ends: 417 [2018-12-03 17:02:06,020 INFO L226 Difference]: Without dead ends: 415 [2018-12-03 17:02:06,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:02:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-12-03 17:02:06,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2018-12-03 17:02:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-12-03 17:02:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 415 transitions. [2018-12-03 17:02:06,026 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 415 transitions. Word has length 410 [2018-12-03 17:02:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:06,026 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 415 transitions. [2018-12-03 17:02:06,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 17:02:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 415 transitions. [2018-12-03 17:02:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-12-03 17:02:06,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:06,028 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 102, 102, 1, 1, 1, 1, 1, 1] [2018-12-03 17:02:06,028 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:06,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:06,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1710939320, now seen corresponding path program 102 times [2018-12-03 17:02:06,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:06,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:06,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:06,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:06,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:10,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:10,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:10,008 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:10,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:10,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:10,008 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:10,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:10,017 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:10,096 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:10,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:10,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:10,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:22,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:22,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 17:02:22,170 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:22,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 17:02:22,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 17:02:22,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 17:02:22,172 INFO L87 Difference]: Start difference. First operand 415 states and 415 transitions. Second operand 105 states. [2018-12-03 17:02:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:22,639 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-12-03 17:02:22,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 17:02:22,640 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 414 [2018-12-03 17:02:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:22,641 INFO L225 Difference]: With dead ends: 421 [2018-12-03 17:02:22,641 INFO L226 Difference]: Without dead ends: 419 [2018-12-03 17:02:22,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 930 GetRequests, 724 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 17:02:22,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-12-03 17:02:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2018-12-03 17:02:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-03 17:02:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 419 transitions. [2018-12-03 17:02:22,647 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 419 transitions. Word has length 414 [2018-12-03 17:02:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:22,647 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 419 transitions. [2018-12-03 17:02:22,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 17:02:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 419 transitions. [2018-12-03 17:02:22,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-12-03 17:02:22,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:22,649 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 103, 103, 1, 1, 1, 1, 1, 1] [2018-12-03 17:02:22,649 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:22,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:22,650 INFO L82 PathProgramCache]: Analyzing trace with hash -486306574, now seen corresponding path program 103 times [2018-12-03 17:02:22,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:22,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:22,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:22,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:22,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:26,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:26,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:26,918 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:26,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:26,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:26,918 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:26,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:26,926 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:27,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:27,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:38,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:38,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 17:02:38,992 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:38,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 17:02:38,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 17:02:38,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 17:02:38,995 INFO L87 Difference]: Start difference. First operand 419 states and 419 transitions. Second operand 106 states. [2018-12-03 17:02:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:39,764 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-12-03 17:02:39,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 17:02:39,765 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 418 [2018-12-03 17:02:39,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:39,766 INFO L225 Difference]: With dead ends: 425 [2018-12-03 17:02:39,766 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 17:02:39,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 939 GetRequests, 731 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 17:02:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 17:02:39,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-12-03 17:02:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-12-03 17:02:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-12-03 17:02:39,771 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 418 [2018-12-03 17:02:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:39,772 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-12-03 17:02:39,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 17:02:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-12-03 17:02:39,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-12-03 17:02:39,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:39,773 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 104, 104, 1, 1, 1, 1, 1, 1] [2018-12-03 17:02:39,774 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:39,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:39,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1308692892, now seen corresponding path program 104 times [2018-12-03 17:02:39,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:39,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:39,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:39,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:39,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:44,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:44,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:44,048 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:44,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:44,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:44,049 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:44,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:44,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:44,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 105 check-sat command(s) [2018-12-03 17:02:44,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:44,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:44,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:56,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:56,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 17:02:56,547 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:56,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 17:02:56,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 17:02:56,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:02:56,550 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 107 states. [2018-12-03 17:02:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:57,297 INFO L93 Difference]: Finished difference Result 429 states and 429 transitions. [2018-12-03 17:02:57,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 17:02:57,298 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 422 [2018-12-03 17:02:57,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:57,299 INFO L225 Difference]: With dead ends: 429 [2018-12-03 17:02:57,299 INFO L226 Difference]: Without dead ends: 427 [2018-12-03 17:02:57,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:02:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-12-03 17:02:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2018-12-03 17:02:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-12-03 17:02:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 427 transitions. [2018-12-03 17:02:57,304 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 427 transitions. Word has length 422 [2018-12-03 17:02:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:57,304 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 427 transitions. [2018-12-03 17:02:57,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 17:02:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 427 transitions. [2018-12-03 17:02:57,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-12-03 17:02:57,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:57,306 INFO L402 BasicCegarLoop]: trace histogram [105, 105, 105, 105, 1, 1, 1, 1, 1, 1] [2018-12-03 17:02:57,306 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:57,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:57,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1073230150, now seen corresponding path program 105 times [2018-12-03 17:02:57,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:57,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:57,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:57,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:57,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:01,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:01,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:01,347 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:01,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:01,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:01,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:01,355 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:01,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:01,439 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:01,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:01,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:01,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:14,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:14,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 17:03:14,049 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:14,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 17:03:14,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 17:03:14,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 17:03:14,051 INFO L87 Difference]: Start difference. First operand 427 states and 427 transitions. Second operand 108 states. [2018-12-03 17:03:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:14,913 INFO L93 Difference]: Finished difference Result 433 states and 433 transitions. [2018-12-03 17:03:14,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 17:03:14,913 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 426 [2018-12-03 17:03:14,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:14,915 INFO L225 Difference]: With dead ends: 433 [2018-12-03 17:03:14,915 INFO L226 Difference]: Without dead ends: 431 [2018-12-03 17:03:14,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 957 GetRequests, 745 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 17:03:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-03 17:03:14,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-12-03 17:03:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-12-03 17:03:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2018-12-03 17:03:14,920 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 426 [2018-12-03 17:03:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:14,920 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2018-12-03 17:03:14,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 17:03:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2018-12-03 17:03:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-12-03 17:03:14,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:14,922 INFO L402 BasicCegarLoop]: trace histogram [106, 106, 106, 106, 1, 1, 1, 1, 1, 1] [2018-12-03 17:03:14,922 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:14,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:14,922 INFO L82 PathProgramCache]: Analyzing trace with hash 480472048, now seen corresponding path program 106 times [2018-12-03 17:03:14,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:14,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:14,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:14,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:14,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:19,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:19,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:19,410 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:19,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:19,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:19,411 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:19,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:19,419 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:19,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:19,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:32,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:32,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 17:03:32,107 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:32,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 17:03:32,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 17:03:32,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 17:03:32,110 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 109 states. [2018-12-03 17:03:32,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:32,740 INFO L93 Difference]: Finished difference Result 437 states and 437 transitions. [2018-12-03 17:03:32,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 17:03:32,741 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 430 [2018-12-03 17:03:32,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:32,742 INFO L225 Difference]: With dead ends: 437 [2018-12-03 17:03:32,742 INFO L226 Difference]: Without dead ends: 435 [2018-12-03 17:03:32,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 752 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 17:03:32,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-12-03 17:03:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2018-12-03 17:03:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-12-03 17:03:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 435 transitions. [2018-12-03 17:03:32,745 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 435 transitions. Word has length 430 [2018-12-03 17:03:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:32,746 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 435 transitions. [2018-12-03 17:03:32,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 17:03:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 435 transitions. [2018-12-03 17:03:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-12-03 17:03:32,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:32,747 INFO L402 BasicCegarLoop]: trace histogram [107, 107, 107, 107, 1, 1, 1, 1, 1, 1] [2018-12-03 17:03:32,748 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:32,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:32,748 INFO L82 PathProgramCache]: Analyzing trace with hash -427998822, now seen corresponding path program 107 times [2018-12-03 17:03:32,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:32,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:32,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:32,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:32,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:36,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:36,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:36,957 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:36,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:36,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:36,957 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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:36,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:36,982 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:37,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 108 check-sat command(s) [2018-12-03 17:03:37,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:37,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:37,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:50,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:50,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 17:03:50,196 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:50,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 17:03:50,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 17:03:50,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:03:50,199 INFO L87 Difference]: Start difference. First operand 435 states and 435 transitions. Second operand 110 states. [2018-12-03 17:03:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:51,114 INFO L93 Difference]: Finished difference Result 441 states and 441 transitions. [2018-12-03 17:03:51,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 17:03:51,114 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 434 [2018-12-03 17:03:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:51,115 INFO L225 Difference]: With dead ends: 441 [2018-12-03 17:03:51,115 INFO L226 Difference]: Without dead ends: 439 [2018-12-03 17:03:51,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 975 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:03:51,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-12-03 17:03:51,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2018-12-03 17:03:51,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-12-03 17:03:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 439 transitions. [2018-12-03 17:03:51,119 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 439 transitions. Word has length 434 [2018-12-03 17:03:51,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:51,119 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 439 transitions. [2018-12-03 17:03:51,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 17:03:51,120 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 439 transitions. [2018-12-03 17:03:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-12-03 17:03:51,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:51,122 INFO L402 BasicCegarLoop]: trace histogram [108, 108, 108, 108, 1, 1, 1, 1, 1, 1] [2018-12-03 17:03:51,122 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:51,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:51,122 INFO L82 PathProgramCache]: Analyzing trace with hash -557829564, now seen corresponding path program 108 times [2018-12-03 17:03:51,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:51,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:51,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:51,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:51,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:55,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:55,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:55,765 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:55,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:55,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:55,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:55,775 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:55,775 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:55,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:55,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:55,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:56,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:09,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:09,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 17:04:09,218 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:09,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 17:04:09,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 17:04:09,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 17:04:09,221 INFO L87 Difference]: Start difference. First operand 439 states and 439 transitions. Second operand 111 states. [2018-12-03 17:04:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:10,029 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2018-12-03 17:04:10,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 17:04:10,030 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 438 [2018-12-03 17:04:10,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:10,031 INFO L225 Difference]: With dead ends: 445 [2018-12-03 17:04:10,031 INFO L226 Difference]: Without dead ends: 443 [2018-12-03 17:04:10,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 17:04:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-12-03 17:04:10,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2018-12-03 17:04:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-12-03 17:04:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-12-03 17:04:10,036 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 438 [2018-12-03 17:04:10,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:10,037 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-12-03 17:04:10,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 17:04:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-12-03 17:04:10,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-12-03 17:04:10,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:10,038 INFO L402 BasicCegarLoop]: trace histogram [109, 109, 109, 109, 1, 1, 1, 1, 1, 1] [2018-12-03 17:04:10,038 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:10,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:10,039 INFO L82 PathProgramCache]: Analyzing trace with hash 627490286, now seen corresponding path program 109 times [2018-12-03 17:04:10,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:10,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:10,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:10,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:10,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:14,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:14,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:14,665 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:14,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:14,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:14,665 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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:14,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:14,674 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:14,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:14,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:27,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:27,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 17:04:27,841 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:27,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 17:04:27,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 17:04:27,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 17:04:27,844 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 112 states. [2018-12-03 17:04:28,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:28,773 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-12-03 17:04:28,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 17:04:28,774 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 442 [2018-12-03 17:04:28,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:28,775 INFO L225 Difference]: With dead ends: 449 [2018-12-03 17:04:28,775 INFO L226 Difference]: Without dead ends: 447 [2018-12-03 17:04:28,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 993 GetRequests, 773 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 17:04:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-12-03 17:04:28,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2018-12-03 17:04:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-12-03 17:04:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 447 transitions. [2018-12-03 17:04:28,779 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 447 transitions. Word has length 442 [2018-12-03 17:04:28,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:28,779 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 447 transitions. [2018-12-03 17:04:28,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 17:04:28,779 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 447 transitions. [2018-12-03 17:04:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-12-03 17:04:28,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:28,781 INFO L402 BasicCegarLoop]: trace histogram [110, 110, 110, 110, 1, 1, 1, 1, 1, 1] [2018-12-03 17:04:28,781 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:28,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:28,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1496016024, now seen corresponding path program 110 times [2018-12-03 17:04:28,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:28,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:28,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:28,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:28,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 24090 backedges. 0 proven. 24090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:33,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:33,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:33,320 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:33,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:33,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:33,320 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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:33,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:04:33,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:04:33,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 111 check-sat command(s) [2018-12-03 17:04:33,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:33,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 24090 backedges. 0 proven. 24090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:33,690 INFO L316 TraceCheckSpWp]: Computing backward predicates...