java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:47:20,034 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:47:20,036 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:47:20,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:47:20,049 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:47:20,050 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:47:20,052 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:47:20,053 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:47:20,055 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:47:20,056 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:47:20,057 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:47:20,057 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:47:20,058 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:47:20,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:47:20,060 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:47:20,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:47:20,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:47:20,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:47:20,075 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:47:20,077 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:47:20,078 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:47:20,080 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:47:20,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:47:20,082 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:47:20,082 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:47:20,083 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:47:20,084 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:47:20,085 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:47:20,086 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:47:20,087 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:47:20,087 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:47:20,088 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:47:20,088 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:47:20,088 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:47:20,089 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:47:20,089 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:47:20,090 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:47:20,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:47:20,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:47:20,104 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:47:20,104 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:47:20,104 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:47:20,104 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:47:20,104 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:47:20,105 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:47:20,105 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:47:20,105 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:47:20,105 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:47:20,106 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:47:20,106 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:47:20,106 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:47:20,106 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:47:20,107 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:47:20,107 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:47:20,107 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:47:20,107 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:47:20,108 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:47:20,108 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:47:20,108 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:47:20,108 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:47:20,109 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:47:20,109 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:47:20,109 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:47:20,109 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:47:20,109 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:47:20,110 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:47:20,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:47:20,110 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:47:20,110 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:47:20,110 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:47:20,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:47:20,111 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:47:20,111 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:47:20,111 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:47:20,111 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:47:20,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:47:20,112 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:47:20,112 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:47:20,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:47:20,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:47:20,169 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:47:20,171 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:47:20,171 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:47:20,172 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2018-12-03 15:47:20,172 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl' [2018-12-03 15:47:20,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:47:20,215 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:47:20,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:47:20,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:47:20,217 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:47:20,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:47:20" (1/1) ... [2018-12-03 15:47:20,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:47:20" (1/1) ... [2018-12-03 15:47:20,253 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:47:20,254 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:47:20,254 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:47:20,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:47:20,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:47:20,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:47:20,258 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:47:20,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:47:20" (1/1) ... [2018-12-03 15:47:20,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:47:20" (1/1) ... [2018-12-03 15:47:20,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:47:20" (1/1) ... [2018-12-03 15:47:20,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:47:20" (1/1) ... [2018-12-03 15:47:20,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:47:20" (1/1) ... [2018-12-03 15:47:20,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:47:20" (1/1) ... [2018-12-03 15:47:20,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:47:20" (1/1) ... [2018-12-03 15:47:20,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:47:20,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:47:20,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:47:20,286 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:47:20,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:47:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:47:20,360 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 15:47:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 15:47:20,361 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 15:47:20,528 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:47:20,529 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:47:20,529 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:47:20 BoogieIcfgContainer [2018-12-03 15:47:20,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:47:20,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:47:20,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:47:20,534 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:47:20,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:47:20" (1/2) ... [2018-12-03 15:47:20,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58bf24bb and model type BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:47:20, skipping insertion in model container [2018-12-03 15:47:20,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:47:20" (2/2) ... [2018-12-03 15:47:20,537 INFO L112 eAbstractionObserver]: Analyzing ICFG BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2018-12-03 15:47:20,547 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:47:20,555 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-03 15:47:20,573 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-03 15:47:20,607 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:47:20,608 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:47:20,608 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:47:20,608 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:47:20,608 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:47:20,609 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:47:20,609 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:47:20,609 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:47:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-03 15:47:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:47:20,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:20,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:47:20,635 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:20,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2018-12-03 15:47:20,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:20,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:20,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:20,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:20,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:20,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:47:20,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:47:20,787 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:47:20,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:47:20,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:47:20,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:47:20,806 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-12-03 15:47:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:20,884 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-12-03 15:47:20,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:47:20,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:47:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:20,896 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:47:20,896 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:47:20,900 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 15:47:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:47:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:47:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:47:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 15:47:20,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 3 [2018-12-03 15:47:20,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:20,932 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 15:47:20,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:47:20,932 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 15:47:20,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:47:20,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:20,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:47:20,933 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:20,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:20,934 INFO L82 PathProgramCache]: Analyzing trace with hash 28755427, now seen corresponding path program 1 times [2018-12-03 15:47:20,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:20,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:20,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:20,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:20,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:21,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:21,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:21,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:21,063 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 15:47:21,065 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [12], [13] [2018-12-03 15:47:21,145 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:47:21,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:47:21,274 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:47:21,275 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:47:21,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:21,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:47:21,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:21,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:21,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:21,308 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:21,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:21,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:21,418 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:47:21,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2018-12-03 15:47:21,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:47:21,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:47:21,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:47:21,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:47:21,420 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 3 states. [2018-12-03 15:47:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:21,472 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-12-03 15:47:21,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:47:21,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 15:47:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:21,473 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:47:21,473 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:47:21,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:47:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:47:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-12-03 15:47:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:47:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-12-03 15:47:21,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 5 [2018-12-03 15:47:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:21,478 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-03 15:47:21,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:47:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-12-03 15:47:21,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:47:21,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:21,479 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 15:47:21,479 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:21,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:21,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1863919784, now seen corresponding path program 1 times [2018-12-03 15:47:21,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:21,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:21,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:21,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:21,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:21,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:21,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:21,549 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-03 15:47:21,549 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [13] [2018-12-03 15:47:21,550 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:47:21,550 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:47:21,639 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:47:21,639 INFO L272 AbstractInterpreter]: Visited 6 different actions 29 times. Merged at 5 different actions 16 times. Widened at 1 different actions 2 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:47:21,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:21,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:47:21,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:21,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:21,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:21,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:21,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:21,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:21,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:21,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:47:21,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:21,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:47:21,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:47:21,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:47:21,749 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 4 states. [2018-12-03 15:47:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:21,803 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-12-03 15:47:21,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:47:21,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 15:47:21,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:21,804 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:47:21,805 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:47:21,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:47:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:47:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:47:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:47:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-12-03 15:47:21,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 7 [2018-12-03 15:47:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:21,809 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-03 15:47:21,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:47:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-12-03 15:47:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:47:21,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:21,810 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-12-03 15:47:21,810 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:21,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:21,811 INFO L82 PathProgramCache]: Analyzing trace with hash 223461163, now seen corresponding path program 2 times [2018-12-03 15:47:21,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:21,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:21,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:21,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:21,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:21,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:21,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:21,936 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:21,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:21,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:21,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:21,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:21,957 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:22,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:47:22,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:22,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:22,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:22,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:22,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2018-12-03 15:47:22,295 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:22,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:47:22,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:47:22,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:47:22,296 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 8 states. [2018-12-03 15:47:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:22,467 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2018-12-03 15:47:22,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:47:22,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 15:47:22,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:22,470 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:47:22,470 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:47:22,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:47:22,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:47:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-03 15:47:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:47:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-03 15:47:22,476 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 9 [2018-12-03 15:47:22,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:22,477 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-03 15:47:22,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:47:22,477 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-12-03 15:47:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:47:22,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:22,478 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-12-03 15:47:22,478 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:22,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:22,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2120520776, now seen corresponding path program 3 times [2018-12-03 15:47:22,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:22,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:22,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:22,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:22,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:47:22,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:22,551 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:22,551 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:22,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:22,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:22,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:22,560 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:22,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:22,586 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:22,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:22,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:47:22,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:47:22,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:22,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:47:22,734 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:22,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:47:22,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:47:22,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:47:22,736 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 6 states. [2018-12-03 15:47:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:22,784 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2018-12-03 15:47:22,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:47:22,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-03 15:47:22,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:22,788 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:47:22,788 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:47:22,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:47:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:47:22,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:47:22,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:47:22,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-03 15:47:22,793 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2018-12-03 15:47:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:22,793 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-03 15:47:22,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:47:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-12-03 15:47:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:47:22,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:22,794 INFO L402 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-12-03 15:47:22,795 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:22,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:22,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1608699707, now seen corresponding path program 4 times [2018-12-03 15:47:22,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:22,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:22,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:22,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:22,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:47:22,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:22,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:22,908 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:22,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:22,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:22,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:22,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:22,920 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:22,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:47:22,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:47:23,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:23,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:47:23,359 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:23,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:47:23,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:47:23,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:47:23,360 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 7 states. [2018-12-03 15:47:23,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:23,394 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-12-03 15:47:23,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:47:23,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-03 15:47:23,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:23,395 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:47:23,396 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:47:23,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:47:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:47:23,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:47:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:47:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-12-03 15:47:23,401 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2018-12-03 15:47:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:23,401 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-03 15:47:23,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:47:23,402 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-12-03 15:47:23,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:47:23,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:23,402 INFO L402 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-12-03 15:47:23,403 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:23,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:23,403 INFO L82 PathProgramCache]: Analyzing trace with hash -908108290, now seen corresponding path program 5 times [2018-12-03 15:47:23,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:23,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:23,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:23,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:23,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:47:23,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:23,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:23,496 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:23,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 15:47:23,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:23,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:23,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:23,507 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:23,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:47:23,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:23,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 15:47:23,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 15:47:23,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:23,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2018-12-03 15:47:23,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:23,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:47:23,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:47:23,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:47:23,737 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 12 states. [2018-12-03 15:47:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:23,858 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2018-12-03 15:47:23,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:47:23,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-12-03 15:47:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:23,860 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:47:23,860 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:47:23,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:47:23,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:47:23,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-03 15:47:23,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:47:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-12-03 15:47:23,866 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2018-12-03 15:47:23,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:23,866 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-03 15:47:23,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:47:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-03 15:47:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:47:23,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:23,867 INFO L402 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1] [2018-12-03 15:47:23,868 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:23,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:23,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1220699322, now seen corresponding path program 6 times [2018-12-03 15:47:23,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:23,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:23,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:23,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:23,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:24,020 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:47:24,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:24,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:24,022 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:24,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:24,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:24,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:24,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:24,036 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:24,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:24,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:24,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:24,064 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:47:24,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:47:24,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:24,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:47:24,435 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:24,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:47:24,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:47:24,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:47:24,436 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 9 states. [2018-12-03 15:47:24,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:24,477 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-12-03 15:47:24,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:47:24,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-03 15:47:24,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:24,478 INFO L225 Difference]: With dead ends: 41 [2018-12-03 15:47:24,478 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:47:24,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:47:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:47:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:47:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:47:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-03 15:47:24,484 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23 [2018-12-03 15:47:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:24,484 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-03 15:47:24,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:47:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-03 15:47:24,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:47:24,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:24,486 INFO L402 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1] [2018-12-03 15:47:24,486 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:24,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:24,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1267282999, now seen corresponding path program 7 times [2018-12-03 15:47:24,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:24,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:24,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:24,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:24,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:47:24,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:24,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:24,593 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:24,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:24,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:24,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:24,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:24,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:24,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:47:24,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:47:24,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:24,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:47:24,807 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:24,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:47:24,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:47:24,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:47:24,809 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 10 states. [2018-12-03 15:47:24,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:24,947 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-12-03 15:47:24,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:47:24,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-03 15:47:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:24,948 INFO L225 Difference]: With dead ends: 43 [2018-12-03 15:47:24,949 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:47:24,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:47:24,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:47:24,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 15:47:24,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:47:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-03 15:47:24,954 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 25 [2018-12-03 15:47:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:24,954 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-03 15:47:24,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:47:24,954 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-03 15:47:24,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:47:24,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:24,955 INFO L402 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1] [2018-12-03 15:47:24,955 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:24,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:24,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1210443660, now seen corresponding path program 8 times [2018-12-03 15:47:24,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:24,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:24,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:24,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:24,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:47:25,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:25,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:25,087 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:25,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:25,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:25,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:25,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:25,098 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:25,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:47:25,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:25,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 15:47:25,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 15:47:25,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:25,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2018-12-03 15:47:25,337 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:25,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:47:25,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:47:25,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:47:25,338 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 16 states. [2018-12-03 15:47:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:25,771 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2018-12-03 15:47:25,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:47:25,773 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-12-03 15:47:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:25,774 INFO L225 Difference]: With dead ends: 48 [2018-12-03 15:47:25,774 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:47:25,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:47:25,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:47:25,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-12-03 15:47:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:47:25,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-12-03 15:47:25,781 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 27 [2018-12-03 15:47:25,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:25,781 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-12-03 15:47:25,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:47:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-12-03 15:47:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:47:25,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:25,785 INFO L402 BasicCegarLoop]: trace histogram [14, 9, 5, 1, 1, 1] [2018-12-03 15:47:25,785 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:25,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:25,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2119432620, now seen corresponding path program 9 times [2018-12-03 15:47:25,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:25,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:25,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:25,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:25,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:47:25,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:25,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:25,961 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:25,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:25,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:25,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:25,970 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:25,970 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:25,989 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:25,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:25,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:25,999 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:47:25,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:47:26,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:26,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 15:47:26,191 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:26,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:47:26,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:47:26,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:47:26,193 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 12 states. [2018-12-03 15:47:26,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:26,256 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-12-03 15:47:26,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:47:26,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-03 15:47:26,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:26,258 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:47:26,258 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:47:26,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:47:26,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:47:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 15:47:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:47:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-03 15:47:26,264 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 31 [2018-12-03 15:47:26,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:26,264 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-03 15:47:26,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:47:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-03 15:47:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:47:26,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:26,266 INFO L402 BasicCegarLoop]: trace histogram [15, 10, 5, 1, 1, 1] [2018-12-03 15:47:26,266 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:26,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:26,266 INFO L82 PathProgramCache]: Analyzing trace with hash -373685289, now seen corresponding path program 10 times [2018-12-03 15:47:26,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:26,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:26,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:26,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:26,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:47:26,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:26,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:26,397 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:26,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:26,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:26,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:26,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:26,408 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:26,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:47:26,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:47:27,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:27,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 15:47:27,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:27,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:47:27,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:47:27,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:47:27,030 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 13 states. [2018-12-03 15:47:27,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:27,351 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-12-03 15:47:27,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:47:27,352 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-12-03 15:47:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:27,353 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:47:27,353 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 15:47:27,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:47:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 15:47:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 15:47:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 15:47:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-03 15:47:27,359 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 33 [2018-12-03 15:47:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:27,359 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-03 15:47:27,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:47:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-12-03 15:47:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:47:27,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:27,360 INFO L402 BasicCegarLoop]: trace histogram [16, 11, 5, 1, 1, 1] [2018-12-03 15:47:27,360 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:27,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:27,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2042712934, now seen corresponding path program 11 times [2018-12-03 15:47:27,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:27,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:27,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:27,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:27,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:47:27,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:27,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:27,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:27,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:27,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:27,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:27,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:27,541 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:27,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 15:47:27,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:27,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:27,701 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 15:47:27,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 15:47:27,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:27,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 26 [2018-12-03 15:47:27,833 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:27,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:47:27,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:47:27,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:47:27,835 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 20 states. [2018-12-03 15:47:27,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:27,928 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-12-03 15:47:27,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:47:27,928 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-12-03 15:47:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:27,929 INFO L225 Difference]: With dead ends: 58 [2018-12-03 15:47:27,929 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:47:27,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:47:27,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:47:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-12-03 15:47:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:47:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-12-03 15:47:27,936 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 35 [2018-12-03 15:47:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:27,936 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-03 15:47:27,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:47:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-03 15:47:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:47:27,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:27,937 INFO L402 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1] [2018-12-03 15:47:27,937 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:27,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:27,937 INFO L82 PathProgramCache]: Analyzing trace with hash -168899358, now seen corresponding path program 12 times [2018-12-03 15:47:27,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:27,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:27,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:27,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:27,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:47:28,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:28,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:28,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:28,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 15:47:28,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:28,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:28,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:28,095 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:28,137 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:28,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:28,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:47:28,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:47:28,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:28,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 15:47:28,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:28,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:47:28,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:47:28,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:47:28,964 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 15 states. [2018-12-03 15:47:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:29,052 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-12-03 15:47:29,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:47:29,052 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-12-03 15:47:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:29,053 INFO L225 Difference]: With dead ends: 61 [2018-12-03 15:47:29,054 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 15:47:29,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:47:29,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 15:47:29,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 15:47:29,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:47:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-12-03 15:47:29,060 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 39 [2018-12-03 15:47:29,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:29,061 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-03 15:47:29,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:47:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-12-03 15:47:29,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:47:29,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:29,062 INFO L402 BasicCegarLoop]: trace histogram [19, 13, 6, 1, 1, 1] [2018-12-03 15:47:29,062 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:29,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:29,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2118871195, now seen corresponding path program 13 times [2018-12-03 15:47:29,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:29,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:29,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:29,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:29,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:47:29,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:29,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:29,246 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:29,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 15:47:29,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:29,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:29,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:29,256 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:29,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:47:29,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:47:30,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:30,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 15:47:30,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:30,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:47:30,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:47:30,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:47:30,162 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 16 states. [2018-12-03 15:47:30,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:30,227 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2018-12-03 15:47:30,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:47:30,228 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-12-03 15:47:30,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:30,228 INFO L225 Difference]: With dead ends: 63 [2018-12-03 15:47:30,229 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 15:47:30,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:47:30,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 15:47:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 15:47:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 15:47:30,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-12-03 15:47:30,234 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 41 [2018-12-03 15:47:30,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:30,235 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-12-03 15:47:30,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:47:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-12-03 15:47:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 15:47:30,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:30,236 INFO L402 BasicCegarLoop]: trace histogram [20, 14, 6, 1, 1, 1] [2018-12-03 15:47:30,236 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:30,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:30,237 INFO L82 PathProgramCache]: Analyzing trace with hash 858901800, now seen corresponding path program 14 times [2018-12-03 15:47:30,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:30,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:30,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:30,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:30,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 210 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:47:30,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:30,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:30,452 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:30,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:30,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:30,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:30,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:30,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:30,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:47:30,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:30,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 15:47:30,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 15:47:31,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:31,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2018-12-03 15:47:31,064 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:31,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:47:31,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:47:31,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:47:31,065 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 24 states. [2018-12-03 15:47:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:31,236 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2018-12-03 15:47:31,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:47:31,236 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-12-03 15:47:31,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:31,238 INFO L225 Difference]: With dead ends: 68 [2018-12-03 15:47:31,238 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 15:47:31,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:47:31,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 15:47:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-12-03 15:47:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 15:47:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-12-03 15:47:31,245 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 43 [2018-12-03 15:47:31,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:31,245 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-12-03 15:47:31,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:47:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-12-03 15:47:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 15:47:31,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:31,246 INFO L402 BasicCegarLoop]: trace histogram [22, 15, 7, 1, 1, 1] [2018-12-03 15:47:31,247 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:31,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:31,247 INFO L82 PathProgramCache]: Analyzing trace with hash -830075152, now seen corresponding path program 15 times [2018-12-03 15:47:31,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:31,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:31,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:31,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:31,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:47:31,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:31,489 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:31,489 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:31,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:31,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:31,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:31,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:31,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:31,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:31,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:31,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:47:31,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:32,230 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:47:32,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:32,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 15:47:32,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:32,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:47:32,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:47:32,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:47:32,250 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 18 states. [2018-12-03 15:47:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:32,305 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-12-03 15:47:32,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:47:32,306 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-12-03 15:47:32,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:32,306 INFO L225 Difference]: With dead ends: 71 [2018-12-03 15:47:32,307 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:47:32,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:47:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:47:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 15:47:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:47:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-12-03 15:47:32,313 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 47 [2018-12-03 15:47:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:32,314 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-12-03 15:47:32,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:47:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-12-03 15:47:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 15:47:32,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:32,315 INFO L402 BasicCegarLoop]: trace histogram [23, 16, 7, 1, 1, 1] [2018-12-03 15:47:32,315 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:32,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:32,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1545165197, now seen corresponding path program 16 times [2018-12-03 15:47:32,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:32,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:32,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:32,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:32,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:47:32,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:32,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:32,726 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:32,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:32,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:32,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:32,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:32,736 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:32,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:47:32,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:47:33,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:33,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 15:47:33,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:33,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:47:33,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:47:33,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:47:33,720 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 19 states. [2018-12-03 15:47:33,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:33,785 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2018-12-03 15:47:33,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:47:33,786 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-03 15:47:33,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:33,787 INFO L225 Difference]: With dead ends: 73 [2018-12-03 15:47:33,787 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 15:47:33,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:47:33,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 15:47:33,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 15:47:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 15:47:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-12-03 15:47:33,793 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 49 [2018-12-03 15:47:33,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:33,794 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-12-03 15:47:33,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:47:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-12-03 15:47:33,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:47:33,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:33,795 INFO L402 BasicCegarLoop]: trace histogram [24, 17, 7, 1, 1, 1] [2018-12-03 15:47:33,795 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:33,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:33,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1551931082, now seen corresponding path program 17 times [2018-12-03 15:47:33,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:33,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:33,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:33,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:33,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 306 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:47:34,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:34,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:34,463 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:34,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:34,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:34,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:34,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:34,473 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:34,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:47:34,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:34,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 15:47:34,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 15:47:35,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:35,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 36 [2018-12-03 15:47:35,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:35,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:47:35,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:47:35,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:47:35,363 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 28 states. [2018-12-03 15:47:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:35,697 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2018-12-03 15:47:35,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:47:35,698 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2018-12-03 15:47:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:35,699 INFO L225 Difference]: With dead ends: 78 [2018-12-03 15:47:35,699 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 15:47:35,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:47:35,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 15:47:35,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-12-03 15:47:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 15:47:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-12-03 15:47:35,704 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 51 [2018-12-03 15:47:35,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:35,704 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-12-03 15:47:35,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:47:35,705 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-12-03 15:47:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 15:47:35,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:35,705 INFO L402 BasicCegarLoop]: trace histogram [26, 18, 8, 1, 1, 1] [2018-12-03 15:47:35,706 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:35,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:35,706 INFO L82 PathProgramCache]: Analyzing trace with hash -311825282, now seen corresponding path program 18 times [2018-12-03 15:47:35,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:35,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:35,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:35,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:35,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:47:36,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:36,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:36,126 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:36,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:36,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:36,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:36,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:36,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:36,152 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:36,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:36,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:36,163 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:47:36,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:47:37,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:37,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 15:47:37,201 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:37,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:47:37,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:47:37,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:47:37,203 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 21 states. [2018-12-03 15:47:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:37,267 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2018-12-03 15:47:37,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:47:37,268 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-12-03 15:47:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:37,269 INFO L225 Difference]: With dead ends: 81 [2018-12-03 15:47:37,269 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 15:47:37,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:47:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 15:47:37,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 15:47:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 15:47:37,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-12-03 15:47:37,275 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 55 [2018-12-03 15:47:37,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:37,275 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-12-03 15:47:37,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:47:37,275 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-12-03 15:47:37,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 15:47:37,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:37,276 INFO L402 BasicCegarLoop]: trace histogram [27, 19, 8, 1, 1, 1] [2018-12-03 15:47:37,277 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:37,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:37,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1622650623, now seen corresponding path program 19 times [2018-12-03 15:47:37,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:37,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:37,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:37,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:37,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:47:37,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:37,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:37,573 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:37,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:37,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:37,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:37,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:37,583 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:37,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:47:37,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:47:38,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:38,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 15:47:38,274 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:38,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:47:38,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:47:38,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:47:38,275 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 22 states. [2018-12-03 15:47:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:38,498 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2018-12-03 15:47:38,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:47:38,499 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-12-03 15:47:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:38,500 INFO L225 Difference]: With dead ends: 83 [2018-12-03 15:47:38,500 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 15:47:38,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 93 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 15:47:38,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 15:47:38,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 15:47:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 15:47:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-12-03 15:47:38,505 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 57 [2018-12-03 15:47:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:38,506 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-12-03 15:47:38,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:47:38,506 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-12-03 15:47:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 15:47:38,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:38,507 INFO L402 BasicCegarLoop]: trace histogram [28, 20, 8, 1, 1, 1] [2018-12-03 15:47:38,507 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:38,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:38,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1394581700, now seen corresponding path program 20 times [2018-12-03 15:47:38,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:38,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:38,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:38,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:38,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 420 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:47:38,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:38,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:38,763 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:38,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:38,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:38,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:38,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:38,772 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:38,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 15:47:38,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:38,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 15:47:38,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 15:47:39,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:39,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 41 [2018-12-03 15:47:39,213 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:39,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:47:39,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:47:39,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:47:39,214 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 32 states. [2018-12-03 15:47:39,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:39,496 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2018-12-03 15:47:39,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:47:39,499 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2018-12-03 15:47:39,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:39,500 INFO L225 Difference]: With dead ends: 88 [2018-12-03 15:47:39,500 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 15:47:39,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:47:39,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 15:47:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-12-03 15:47:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 15:47:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-12-03 15:47:39,506 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 59 [2018-12-03 15:47:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:39,506 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-12-03 15:47:39,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:47:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-12-03 15:47:39,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:47:39,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:39,507 INFO L402 BasicCegarLoop]: trace histogram [30, 21, 9, 1, 1, 1] [2018-12-03 15:47:39,507 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:39,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:39,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1577747852, now seen corresponding path program 21 times [2018-12-03 15:47:39,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:39,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:39,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:39,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:39,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:47:39,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:39,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:39,814 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:39,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:39,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:39,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:39,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:39,822 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:39,839 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:39,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:39,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:47:39,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:47:40,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:40,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 15:47:40,410 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:40,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:47:40,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:47:40,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:47:40,411 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 24 states. [2018-12-03 15:47:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:40,506 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2018-12-03 15:47:40,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:47:40,506 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-12-03 15:47:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:40,507 INFO L225 Difference]: With dead ends: 91 [2018-12-03 15:47:40,507 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 15:47:40,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:47:40,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 15:47:40,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 15:47:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 15:47:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-03 15:47:40,513 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 63 [2018-12-03 15:47:40,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:40,513 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-03 15:47:40,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:47:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-03 15:47:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 15:47:40,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:40,514 INFO L402 BasicCegarLoop]: trace histogram [31, 22, 9, 1, 1, 1] [2018-12-03 15:47:40,514 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:40,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:40,515 INFO L82 PathProgramCache]: Analyzing trace with hash -330713329, now seen corresponding path program 22 times [2018-12-03 15:47:40,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:40,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:40,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:40,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:40,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:47:41,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:41,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:41,033 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:41,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:41,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:41,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:41,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:41,045 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:41,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:47:41,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:47:41,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:41,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 15:47:41,779 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:41,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:47:41,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:47:41,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:47:41,781 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 25 states. [2018-12-03 15:47:41,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:41,887 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2018-12-03 15:47:41,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:47:41,888 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-12-03 15:47:41,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:41,888 INFO L225 Difference]: With dead ends: 93 [2018-12-03 15:47:41,888 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 15:47:41,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:47:41,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 15:47:41,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 15:47:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 15:47:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-12-03 15:47:41,893 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 65 [2018-12-03 15:47:41,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:41,893 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-12-03 15:47:41,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:47:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-12-03 15:47:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 15:47:41,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:41,894 INFO L402 BasicCegarLoop]: trace histogram [32, 23, 9, 1, 1, 1] [2018-12-03 15:47:41,894 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:41,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:41,895 INFO L82 PathProgramCache]: Analyzing trace with hash -410872878, now seen corresponding path program 23 times [2018-12-03 15:47:41,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:41,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:41,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:41,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:41,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 552 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:47:42,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:42,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:42,286 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:42,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:42,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:42,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:42,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:42,299 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:42,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 15:47:42,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:42,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 15:47:42,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 15:47:42,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:42,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 46 [2018-12-03 15:47:42,968 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:42,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:47:42,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:47:42,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:47:42,969 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 36 states. [2018-12-03 15:47:43,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:43,159 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2018-12-03 15:47:43,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:47:43,159 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-12-03 15:47:43,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:43,159 INFO L225 Difference]: With dead ends: 98 [2018-12-03 15:47:43,160 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 15:47:43,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:47:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 15:47:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-12-03 15:47:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 15:47:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2018-12-03 15:47:43,163 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 67 [2018-12-03 15:47:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:43,163 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-12-03 15:47:43,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:47:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-12-03 15:47:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 15:47:43,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:43,164 INFO L402 BasicCegarLoop]: trace histogram [34, 24, 10, 1, 1, 1] [2018-12-03 15:47:43,164 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:43,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:43,164 INFO L82 PathProgramCache]: Analyzing trace with hash -682624486, now seen corresponding path program 24 times [2018-12-03 15:47:43,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:43,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:43,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:43,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:43,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:47:43,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:43,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:43,490 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:43,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:43,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:43,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:43,508 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:43,508 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:43,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:43,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:43,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:47:43,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:47:44,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:44,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 15:47:44,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:44,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:47:44,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:47:44,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:47:44,256 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 27 states. [2018-12-03 15:47:44,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:44,385 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2018-12-03 15:47:44,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:47:44,386 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 71 [2018-12-03 15:47:44,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:44,387 INFO L225 Difference]: With dead ends: 101 [2018-12-03 15:47:44,387 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:47:44,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:47:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:47:44,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 15:47:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:47:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-12-03 15:47:44,391 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 71 [2018-12-03 15:47:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:44,391 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-12-03 15:47:44,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:47:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-12-03 15:47:44,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 15:47:44,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:44,392 INFO L402 BasicCegarLoop]: trace histogram [35, 25, 10, 1, 1, 1] [2018-12-03 15:47:44,392 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:44,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:44,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1361905507, now seen corresponding path program 25 times [2018-12-03 15:47:44,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:44,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:44,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:44,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:44,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:47:44,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:44,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:44,789 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:44,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:44,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:44,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:44,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:44,798 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:44,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:47:44,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:47:45,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:45,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 51 [2018-12-03 15:47:45,805 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:45,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:47:45,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:47:45,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:47:45,807 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 28 states. [2018-12-03 15:47:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:46,209 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2018-12-03 15:47:46,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:47:46,209 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2018-12-03 15:47:46,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:46,210 INFO L225 Difference]: With dead ends: 103 [2018-12-03 15:47:46,210 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 15:47:46,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:47:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 15:47:46,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 15:47:46,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 15:47:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-12-03 15:47:46,214 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 73 [2018-12-03 15:47:46,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:46,214 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-12-03 15:47:46,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:47:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-12-03 15:47:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:47:46,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:46,215 INFO L402 BasicCegarLoop]: trace histogram [36, 26, 10, 1, 1, 1] [2018-12-03 15:47:46,216 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:46,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:46,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1315937696, now seen corresponding path program 26 times [2018-12-03 15:47:46,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:46,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:46,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:46,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:46,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 702 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:47:47,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:47,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:47,479 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:47,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:47,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:47,480 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:47,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:47,489 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:47,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 15:47:47,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:47,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 15:47:47,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 15:47:48,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:48,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 13] total 51 [2018-12-03 15:47:48,157 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:48,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:47:48,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:47:48,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:47:48,158 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 40 states. [2018-12-03 15:47:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:48,331 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2018-12-03 15:47:48,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:47:48,331 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 75 [2018-12-03 15:47:48,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:48,332 INFO L225 Difference]: With dead ends: 108 [2018-12-03 15:47:48,332 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 15:47:48,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:47:48,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 15:47:48,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-12-03 15:47:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 15:47:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-12-03 15:47:48,337 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 75 [2018-12-03 15:47:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:48,338 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-12-03 15:47:48,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:47:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-12-03 15:47:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 15:47:48,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:48,339 INFO L402 BasicCegarLoop]: trace histogram [38, 27, 11, 1, 1, 1] [2018-12-03 15:47:48,339 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:48,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:48,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1113953752, now seen corresponding path program 27 times [2018-12-03 15:47:48,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:48,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:48,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:48,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:48,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:47:48,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:48,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:48,762 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:48,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:48,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:48,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:48,771 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:48,771 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:48,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:48,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:48,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:47:48,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:47:49,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:49,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 51 [2018-12-03 15:47:49,711 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:49,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:47:49,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:47:49,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:47:49,712 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 30 states. [2018-12-03 15:47:49,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:49,816 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2018-12-03 15:47:49,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:47:49,817 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-12-03 15:47:49,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:49,818 INFO L225 Difference]: With dead ends: 111 [2018-12-03 15:47:49,818 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 15:47:49,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:47:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 15:47:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 15:47:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 15:47:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-12-03 15:47:49,823 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 79 [2018-12-03 15:47:49,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:49,823 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-12-03 15:47:49,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:47:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-12-03 15:47:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 15:47:49,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:49,824 INFO L402 BasicCegarLoop]: trace histogram [39, 28, 11, 1, 1, 1] [2018-12-03 15:47:49,824 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:49,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:49,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1203489365, now seen corresponding path program 28 times [2018-12-03 15:47:49,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:49,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:49,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:49,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:49,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:47:50,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:50,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:50,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:50,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:50,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:50,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:50,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:50,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:51,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:47:51,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:47:52,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:52,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 51 [2018-12-03 15:47:52,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:52,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:47:52,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:47:52,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:47:52,186 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 31 states. [2018-12-03 15:47:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:52,303 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2018-12-03 15:47:52,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:47:52,304 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2018-12-03 15:47:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:52,305 INFO L225 Difference]: With dead ends: 113 [2018-12-03 15:47:52,305 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 15:47:52,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 132 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:47:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 15:47:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 15:47:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 15:47:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-12-03 15:47:52,310 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 81 [2018-12-03 15:47:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:52,311 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-12-03 15:47:52,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:47:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2018-12-03 15:47:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 15:47:52,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:52,312 INFO L402 BasicCegarLoop]: trace histogram [40, 29, 11, 1, 1, 1] [2018-12-03 15:47:52,312 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:52,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:52,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1347867538, now seen corresponding path program 29 times [2018-12-03 15:47:52,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:52,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:52,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:52,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:52,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 630 proven. 870 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:47:52,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:52,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:52,714 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:52,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:52,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:52,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:52,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:52,725 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:52,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 15:47:52,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:52,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 15:47:53,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 15:47:53,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:53,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 14, 14] total 56 [2018-12-03 15:47:53,788 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:53,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:47:53,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:47:53,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:47:53,789 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 44 states. [2018-12-03 15:47:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:53,973 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2018-12-03 15:47:53,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:47:53,974 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 83 [2018-12-03 15:47:53,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:53,975 INFO L225 Difference]: With dead ends: 118 [2018-12-03 15:47:53,975 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 15:47:53,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 141 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 15:47:53,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 15:47:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-12-03 15:47:53,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 15:47:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-12-03 15:47:53,980 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 83 [2018-12-03 15:47:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:53,980 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-12-03 15:47:53,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:47:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-12-03 15:47:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 15:47:53,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:53,981 INFO L402 BasicCegarLoop]: trace histogram [42, 30, 12, 1, 1, 1] [2018-12-03 15:47:53,982 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:53,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:53,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1530792522, now seen corresponding path program 30 times [2018-12-03 15:47:53,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:53,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:53,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:53,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:53,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:54,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:47:54,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:54,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:54,416 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:54,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:54,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:54,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:54,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:54,426 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:54,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:54,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:54,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:47:54,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:47:55,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:55,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 51 [2018-12-03 15:47:55,277 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:55,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:47:55,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:47:55,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:47:55,278 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 33 states. [2018-12-03 15:47:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:55,420 INFO L93 Difference]: Finished difference Result 121 states and 146 transitions. [2018-12-03 15:47:55,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:47:55,421 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-12-03 15:47:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:55,422 INFO L225 Difference]: With dead ends: 121 [2018-12-03 15:47:55,422 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 15:47:55,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 142 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:47:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 15:47:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 15:47:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 15:47:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2018-12-03 15:47:55,427 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 87 [2018-12-03 15:47:55,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:55,428 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2018-12-03 15:47:55,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:47:55,428 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2018-12-03 15:47:55,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 15:47:55,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:55,428 INFO L402 BasicCegarLoop]: trace histogram [43, 31, 12, 1, 1, 1] [2018-12-03 15:47:55,429 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:55,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:55,429 INFO L82 PathProgramCache]: Analyzing trace with hash 158699065, now seen corresponding path program 31 times [2018-12-03 15:47:55,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:55,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:55,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:55,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:55,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:47:56,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:56,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:56,111 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:56,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:56,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:56,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:56,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:56,125 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:56,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:47:56,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:47:57,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:57,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2018-12-03 15:47:57,260 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:57,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:47:57,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:47:57,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:47:57,261 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 34 states. [2018-12-03 15:47:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:57,380 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2018-12-03 15:47:57,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:47:57,381 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 89 [2018-12-03 15:47:57,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:57,382 INFO L225 Difference]: With dead ends: 123 [2018-12-03 15:47:57,382 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 15:47:57,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 145 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:47:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 15:47:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 15:47:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 15:47:57,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2018-12-03 15:47:57,387 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 89 [2018-12-03 15:47:57,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:57,388 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2018-12-03 15:47:57,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:47:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2018-12-03 15:47:57,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 15:47:57,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:57,389 INFO L402 BasicCegarLoop]: trace histogram [44, 32, 12, 1, 1, 1] [2018-12-03 15:47:57,389 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:57,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:57,389 INFO L82 PathProgramCache]: Analyzing trace with hash 262476284, now seen corresponding path program 32 times [2018-12-03 15:47:57,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:57,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:57,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:57,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:57,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 759 proven. 1056 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:47:57,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:57,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:57,832 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:57,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:57,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:57,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:57,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:57,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:57,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 15:47:57,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:57,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 15:47:58,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 15:47:59,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:59,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 15, 15] total 61 [2018-12-03 15:47:59,325 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:59,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:47:59,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:47:59,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:47:59,326 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 48 states. [2018-12-03 15:47:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:59,556 INFO L93 Difference]: Finished difference Result 128 states and 156 transitions. [2018-12-03 15:47:59,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:47:59,560 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 91 [2018-12-03 15:47:59,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:59,561 INFO L225 Difference]: With dead ends: 128 [2018-12-03 15:47:59,561 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 15:47:59,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:47:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 15:47:59,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-12-03 15:47:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 15:47:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2018-12-03 15:47:59,565 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 91 [2018-12-03 15:47:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:59,565 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2018-12-03 15:47:59,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:47:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2018-12-03 15:47:59,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 15:47:59,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:59,566 INFO L402 BasicCegarLoop]: trace histogram [46, 33, 13, 1, 1, 1] [2018-12-03 15:47:59,566 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:59,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:59,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1377221828, now seen corresponding path program 33 times [2018-12-03 15:47:59,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:59,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:59,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:59,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:59,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:00,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:48:00,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:00,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:00,366 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:00,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:00,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:00,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:00,375 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:00,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:00,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:00,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:00,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:48:00,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:48:01,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:01,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 51 [2018-12-03 15:48:01,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:01,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:48:01,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:48:01,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:01,236 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 36 states. [2018-12-03 15:48:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:01,371 INFO L93 Difference]: Finished difference Result 131 states and 158 transitions. [2018-12-03 15:48:01,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:48:01,372 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 95 [2018-12-03 15:48:01,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:01,373 INFO L225 Difference]: With dead ends: 131 [2018-12-03 15:48:01,373 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:48:01,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 155 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:48:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 15:48:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:48:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2018-12-03 15:48:01,378 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 95 [2018-12-03 15:48:01,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:01,379 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2018-12-03 15:48:01,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:48:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2018-12-03 15:48:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 15:48:01,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:01,379 INFO L402 BasicCegarLoop]: trace histogram [47, 34, 13, 1, 1, 1] [2018-12-03 15:48:01,380 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:01,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:01,380 INFO L82 PathProgramCache]: Analyzing trace with hash -726195641, now seen corresponding path program 34 times [2018-12-03 15:48:01,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:01,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:01,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:01,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:01,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:48:01,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:01,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:01,994 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:01,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:01,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:01,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:02,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:02,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:02,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:48:02,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:48:02,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:02,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 51 [2018-12-03 15:48:02,916 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:02,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:48:02,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:48:02,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:02,917 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 37 states. [2018-12-03 15:48:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:03,019 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2018-12-03 15:48:03,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:48:03,019 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 97 [2018-12-03 15:48:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:03,020 INFO L225 Difference]: With dead ends: 133 [2018-12-03 15:48:03,021 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 15:48:03,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 158 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 15:48:03,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 15:48:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 15:48:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2018-12-03 15:48:03,025 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 97 [2018-12-03 15:48:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:03,026 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2018-12-03 15:48:03,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:48:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2018-12-03 15:48:03,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 15:48:03,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:03,027 INFO L402 BasicCegarLoop]: trace histogram [48, 35, 13, 1, 1, 1] [2018-12-03 15:48:03,027 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:03,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:03,028 INFO L82 PathProgramCache]: Analyzing trace with hash 819213066, now seen corresponding path program 35 times [2018-12-03 15:48:03,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:03,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:03,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:03,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:03,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 900 proven. 1260 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:48:03,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:03,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:03,905 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:03,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:03,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:03,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:03,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:03,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:03,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 15:48:03,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:03,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 15:48:04,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 15:48:04,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:04,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 16, 16] total 66 [2018-12-03 15:48:04,919 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:04,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:48:04,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:48:04,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:48:04,921 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 52 states. [2018-12-03 15:48:05,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:05,162 INFO L93 Difference]: Finished difference Result 138 states and 168 transitions. [2018-12-03 15:48:05,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:48:05,163 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 99 [2018-12-03 15:48:05,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:05,164 INFO L225 Difference]: With dead ends: 138 [2018-12-03 15:48:05,164 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 15:48:05,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:48:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 15:48:05,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-12-03 15:48:05,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 15:48:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-12-03 15:48:05,170 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 99 [2018-12-03 15:48:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:05,170 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-12-03 15:48:05,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:48:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-12-03 15:48:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 15:48:05,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:05,171 INFO L402 BasicCegarLoop]: trace histogram [50, 36, 14, 1, 1, 1] [2018-12-03 15:48:05,171 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:05,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:05,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1046536018, now seen corresponding path program 36 times [2018-12-03 15:48:05,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:05,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:05,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:05,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:05,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:48:05,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:05,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:05,831 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:05,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:05,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:05,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:05,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:05,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:05,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:05,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:05,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:48:05,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:48:07,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:07,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 51 [2018-12-03 15:48:07,053 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:07,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:48:07,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:48:07,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:07,055 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 39 states. [2018-12-03 15:48:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:07,238 INFO L93 Difference]: Finished difference Result 141 states and 170 transitions. [2018-12-03 15:48:07,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:48:07,238 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 103 [2018-12-03 15:48:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:07,240 INFO L225 Difference]: With dead ends: 141 [2018-12-03 15:48:07,240 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 15:48:07,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 168 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 15:48:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 15:48:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 15:48:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2018-12-03 15:48:07,247 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 103 [2018-12-03 15:48:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:07,247 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2018-12-03 15:48:07,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:48:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2018-12-03 15:48:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 15:48:07,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:07,248 INFO L402 BasicCegarLoop]: trace histogram [51, 37, 14, 1, 1, 1] [2018-12-03 15:48:07,248 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:07,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:07,248 INFO L82 PathProgramCache]: Analyzing trace with hash -3075627, now seen corresponding path program 37 times [2018-12-03 15:48:07,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:07,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:07,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:07,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:07,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:48:07,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:07,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:07,893 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:07,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:07,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:07,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:07,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:07,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:07,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:48:07,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:48:08,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:08,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 51 [2018-12-03 15:48:08,864 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:08,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:48:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:48:08,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:08,865 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 40 states. [2018-12-03 15:48:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:09,064 INFO L93 Difference]: Finished difference Result 143 states and 172 transitions. [2018-12-03 15:48:09,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:48:09,064 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 105 [2018-12-03 15:48:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:09,065 INFO L225 Difference]: With dead ends: 143 [2018-12-03 15:48:09,066 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 15:48:09,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 171 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 15:48:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 15:48:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 15:48:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-12-03 15:48:09,071 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 105 [2018-12-03 15:48:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:09,071 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-12-03 15:48:09,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:48:09,071 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-12-03 15:48:09,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 15:48:09,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:09,072 INFO L402 BasicCegarLoop]: trace histogram [52, 38, 14, 1, 1, 1] [2018-12-03 15:48:09,072 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:09,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:09,072 INFO L82 PathProgramCache]: Analyzing trace with hash 637448088, now seen corresponding path program 38 times [2018-12-03 15:48:09,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:09,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:09,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:09,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:09,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1053 proven. 1482 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:48:09,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:09,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:09,807 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:09,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:09,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:09,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:09,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:09,818 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:09,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 15:48:09,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:09,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 15:48:10,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 15:48:10,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:10,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 17, 17] total 71 [2018-12-03 15:48:10,985 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:10,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:48:10,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:48:10,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:48:10,987 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 56 states. [2018-12-03 15:48:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:12,366 INFO L93 Difference]: Finished difference Result 148 states and 180 transitions. [2018-12-03 15:48:12,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:48:12,367 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 107 [2018-12-03 15:48:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:12,369 INFO L225 Difference]: With dead ends: 148 [2018-12-03 15:48:12,369 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 15:48:12,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:48:12,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 15:48:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-12-03 15:48:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 15:48:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-12-03 15:48:12,373 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 107 [2018-12-03 15:48:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:12,374 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-12-03 15:48:12,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:48:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-12-03 15:48:12,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 15:48:12,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:12,375 INFO L402 BasicCegarLoop]: trace histogram [54, 39, 15, 1, 1, 1] [2018-12-03 15:48:12,375 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:12,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:12,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1746895520, now seen corresponding path program 39 times [2018-12-03 15:48:12,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:12,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:12,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:12,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:12,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:48:13,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:13,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:13,592 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:13,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:13,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:13,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:13,601 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:13,601 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:13,634 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:13,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:13,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:48:13,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:48:14,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:14,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 51 [2018-12-03 15:48:14,809 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:14,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:48:14,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:48:14,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:14,810 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 42 states. [2018-12-03 15:48:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:15,015 INFO L93 Difference]: Finished difference Result 151 states and 182 transitions. [2018-12-03 15:48:15,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:48:15,016 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-12-03 15:48:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:15,017 INFO L225 Difference]: With dead ends: 151 [2018-12-03 15:48:15,017 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 15:48:15,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 181 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 15:48:15,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 15:48:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 15:48:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2018-12-03 15:48:15,023 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 111 [2018-12-03 15:48:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:15,023 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2018-12-03 15:48:15,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:48:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2018-12-03 15:48:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 15:48:15,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:15,025 INFO L402 BasicCegarLoop]: trace histogram [55, 40, 15, 1, 1, 1] [2018-12-03 15:48:15,025 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:15,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:15,025 INFO L82 PathProgramCache]: Analyzing trace with hash 637762787, now seen corresponding path program 40 times [2018-12-03 15:48:15,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:15,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:15,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:15,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:15,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:48:15,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:15,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:15,801 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:15,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:15,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:15,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:15,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:15,811 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:15,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:15,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:48:15,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:48:17,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:17,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 51 [2018-12-03 15:48:17,208 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:17,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:48:17,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:48:17,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:17,209 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand 43 states. [2018-12-03 15:48:17,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:17,327 INFO L93 Difference]: Finished difference Result 153 states and 184 transitions. [2018-12-03 15:48:17,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:48:17,327 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 113 [2018-12-03 15:48:17,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:17,328 INFO L225 Difference]: With dead ends: 153 [2018-12-03 15:48:17,329 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 15:48:17,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 184 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 15:48:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 15:48:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 15:48:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2018-12-03 15:48:17,334 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 113 [2018-12-03 15:48:17,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:17,334 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2018-12-03 15:48:17,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:48:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2018-12-03 15:48:17,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 15:48:17,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:17,335 INFO L402 BasicCegarLoop]: trace histogram [56, 41, 15, 1, 1, 1] [2018-12-03 15:48:17,335 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:17,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:17,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1218140250, now seen corresponding path program 41 times [2018-12-03 15:48:17,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:17,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:17,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:17,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:17,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1218 proven. 1722 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:48:18,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:18,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:18,227 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:18,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:18,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:18,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:18,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:18,239 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:18,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 15:48:18,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:18,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 15:48:18,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 15:48:19,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:19,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 18, 18] total 76 [2018-12-03 15:48:19,594 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:19,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:48:19,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:48:19,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:48:19,596 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 60 states. [2018-12-03 15:48:20,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:20,138 INFO L93 Difference]: Finished difference Result 158 states and 192 transitions. [2018-12-03 15:48:20,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:48:20,138 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 115 [2018-12-03 15:48:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:20,139 INFO L225 Difference]: With dead ends: 158 [2018-12-03 15:48:20,139 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 15:48:20,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:48:20,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 15:48:20,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-12-03 15:48:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 15:48:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-12-03 15:48:20,145 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 115 [2018-12-03 15:48:20,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:20,146 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-12-03 15:48:20,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:48:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-12-03 15:48:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 15:48:20,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:20,147 INFO L402 BasicCegarLoop]: trace histogram [58, 42, 16, 1, 1, 1] [2018-12-03 15:48:20,147 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:20,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:20,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1001539858, now seen corresponding path program 42 times [2018-12-03 15:48:20,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:20,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:20,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:20,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:20,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:48:21,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:21,300 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:21,301 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:21,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 15:48:21,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:21,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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:21,311 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:21,311 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:21,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:21,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:21,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:48:21,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:48:22,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:22,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 51 [2018-12-03 15:48:22,641 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:22,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:48:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:48:22,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:22,642 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 45 states. [2018-12-03 15:48:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:22,763 INFO L93 Difference]: Finished difference Result 161 states and 194 transitions. [2018-12-03 15:48:22,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:48:22,763 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 119 [2018-12-03 15:48:22,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:22,765 INFO L225 Difference]: With dead ends: 161 [2018-12-03 15:48:22,765 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 15:48:22,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 194 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:22,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 15:48:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 15:48:22,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 15:48:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2018-12-03 15:48:22,771 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 119 [2018-12-03 15:48:22,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:22,771 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2018-12-03 15:48:22,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:48:22,771 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2018-12-03 15:48:22,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 15:48:22,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:22,772 INFO L402 BasicCegarLoop]: trace histogram [59, 43, 16, 1, 1, 1] [2018-12-03 15:48:22,772 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:22,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash 436634481, now seen corresponding path program 43 times [2018-12-03 15:48:22,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:22,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:22,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:22,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:22,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:23,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:48:23,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:23,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:23,584 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:23,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:23,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:23,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:23,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:23,594 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:23,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:48:23,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:48:24,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:24,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 51 [2018-12-03 15:48:24,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:24,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:48:24,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:48:24,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:24,552 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 46 states. [2018-12-03 15:48:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:24,812 INFO L93 Difference]: Finished difference Result 163 states and 196 transitions. [2018-12-03 15:48:24,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:48:24,813 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 121 [2018-12-03 15:48:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:24,814 INFO L225 Difference]: With dead ends: 163 [2018-12-03 15:48:24,814 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 15:48:24,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 197 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 15:48:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 15:48:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 15:48:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-12-03 15:48:24,818 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 121 [2018-12-03 15:48:24,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:24,819 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-12-03 15:48:24,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:48:24,819 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-12-03 15:48:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 15:48:24,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:24,820 INFO L402 BasicCegarLoop]: trace histogram [60, 44, 16, 1, 1, 1] [2018-12-03 15:48:24,820 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:24,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:24,820 INFO L82 PathProgramCache]: Analyzing trace with hash -457295052, now seen corresponding path program 44 times [2018-12-03 15:48:24,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:24,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:24,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:24,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:24,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1395 proven. 1980 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:48:27,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:27,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:27,907 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:27,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:27,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:27,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:27,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:27,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:27,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 15:48:27,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:27,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 15:48:28,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 15:48:29,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:29,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 19, 19] total 81 [2018-12-03 15:48:29,475 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:29,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:48:29,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:48:29,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 15:48:29,476 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand 64 states. [2018-12-03 15:48:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:29,812 INFO L93 Difference]: Finished difference Result 168 states and 204 transitions. [2018-12-03 15:48:29,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:48:29,812 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 123 [2018-12-03 15:48:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:29,814 INFO L225 Difference]: With dead ends: 168 [2018-12-03 15:48:29,814 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 15:48:29,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 15:48:29,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 15:48:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-12-03 15:48:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 15:48:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2018-12-03 15:48:29,819 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 123 [2018-12-03 15:48:29,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:29,820 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2018-12-03 15:48:29,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:48:29,820 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2018-12-03 15:48:29,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 15:48:29,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:29,820 INFO L402 BasicCegarLoop]: trace histogram [62, 45, 17, 1, 1, 1] [2018-12-03 15:48:29,821 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:29,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:29,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1658366972, now seen corresponding path program 45 times [2018-12-03 15:48:29,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:29,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:29,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:29,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:29,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:48:30,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:30,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:30,941 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:30,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:30,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:30,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:30,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:30,950 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:30,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:30,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:30,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:48:31,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:48:31,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:31,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 51 [2018-12-03 15:48:31,981 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:31,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:48:31,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:48:31,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:31,982 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand 48 states. [2018-12-03 15:48:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:32,240 INFO L93 Difference]: Finished difference Result 171 states and 206 transitions. [2018-12-03 15:48:32,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:48:32,240 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-12-03 15:48:32,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:32,241 INFO L225 Difference]: With dead ends: 171 [2018-12-03 15:48:32,242 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 15:48:32,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 207 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 15:48:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 15:48:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 15:48:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2018-12-03 15:48:32,247 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 127 [2018-12-03 15:48:32,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:32,247 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2018-12-03 15:48:32,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:48:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2018-12-03 15:48:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 15:48:32,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:32,249 INFO L402 BasicCegarLoop]: trace histogram [63, 46, 17, 1, 1, 1] [2018-12-03 15:48:32,249 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:32,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:32,249 INFO L82 PathProgramCache]: Analyzing trace with hash -401980033, now seen corresponding path program 46 times [2018-12-03 15:48:32,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:32,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:32,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:32,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:32,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:48:33,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:33,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:33,242 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:33,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:33,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:33,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:33,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:33,250 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:33,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:48:33,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:34,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:48:34,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:34,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 51 [2018-12-03 15:48:34,261 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:34,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:48:34,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:48:34,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:34,262 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand 49 states. [2018-12-03 15:48:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:34,433 INFO L93 Difference]: Finished difference Result 173 states and 208 transitions. [2018-12-03 15:48:34,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:48:34,433 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 129 [2018-12-03 15:48:34,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:34,435 INFO L225 Difference]: With dead ends: 173 [2018-12-03 15:48:34,435 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 15:48:34,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 210 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 15:48:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-03 15:48:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 15:48:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2018-12-03 15:48:34,440 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 129 [2018-12-03 15:48:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:34,441 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2018-12-03 15:48:34,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:48:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2018-12-03 15:48:34,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 15:48:34,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:34,442 INFO L402 BasicCegarLoop]: trace histogram [64, 47, 17, 1, 1, 1] [2018-12-03 15:48:34,442 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:34,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:34,442 INFO L82 PathProgramCache]: Analyzing trace with hash -415528382, now seen corresponding path program 47 times [2018-12-03 15:48:34,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:34,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:34,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:34,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:34,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1584 proven. 2256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:48:35,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:35,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:35,856 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:35,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:35,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:35,856 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:35,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:35,865 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:35,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 15:48:35,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:35,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 15:48:36,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 15:48:37,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:37,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 20, 20] total 86 [2018-12-03 15:48:37,999 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:37,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:48:38,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:48:38,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:48:38,000 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand 68 states. [2018-12-03 15:48:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:38,369 INFO L93 Difference]: Finished difference Result 178 states and 216 transitions. [2018-12-03 15:48:38,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:48:38,369 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 131 [2018-12-03 15:48:38,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:38,370 INFO L225 Difference]: With dead ends: 178 [2018-12-03 15:48:38,370 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 15:48:38,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:48:38,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 15:48:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-12-03 15:48:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 15:48:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2018-12-03 15:48:38,375 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 131 [2018-12-03 15:48:38,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:38,375 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2018-12-03 15:48:38,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:48:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2018-12-03 15:48:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 15:48:38,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:38,377 INFO L402 BasicCegarLoop]: trace histogram [66, 48, 18, 1, 1, 1] [2018-12-03 15:48:38,377 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:38,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:38,377 INFO L82 PathProgramCache]: Analyzing trace with hash -836141942, now seen corresponding path program 48 times [2018-12-03 15:48:38,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:38,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:38,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:38,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:38,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:48:39,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:39,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:39,760 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:39,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:39,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:39,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:39,769 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:39,769 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:39,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:39,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:39,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:48:39,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:48:40,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:40,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 51 [2018-12-03 15:48:40,734 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:40,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:48:40,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:48:40,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:40,735 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand 51 states. [2018-12-03 15:48:42,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:42,274 INFO L93 Difference]: Finished difference Result 181 states and 218 transitions. [2018-12-03 15:48:42,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:48:42,275 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 135 [2018-12-03 15:48:42,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:42,276 INFO L225 Difference]: With dead ends: 181 [2018-12-03 15:48:42,276 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 15:48:42,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 220 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 15:48:42,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 15:48:42,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 15:48:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2018-12-03 15:48:42,281 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 135 [2018-12-03 15:48:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:42,282 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2018-12-03 15:48:42,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:48:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2018-12-03 15:48:42,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 15:48:42,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:42,282 INFO L402 BasicCegarLoop]: trace histogram [67, 49, 18, 1, 1, 1] [2018-12-03 15:48:42,282 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:42,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:42,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1471603469, now seen corresponding path program 49 times [2018-12-03 15:48:42,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:42,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:42,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:42,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:42,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:48:43,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:43,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:43,446 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:43,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:43,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:43,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:43,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:43,455 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:43,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:48:43,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:48:44,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:44,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 15:48:44,966 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:44,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:48:44,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:48:44,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:44,967 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand 52 states. [2018-12-03 15:48:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:45,112 INFO L93 Difference]: Finished difference Result 183 states and 220 transitions. [2018-12-03 15:48:45,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:48:45,112 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 137 [2018-12-03 15:48:45,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:45,114 INFO L225 Difference]: With dead ends: 183 [2018-12-03 15:48:45,114 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 15:48:45,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 223 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 15:48:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 15:48:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 15:48:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2018-12-03 15:48:45,119 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 137 [2018-12-03 15:48:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:45,119 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2018-12-03 15:48:45,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:48:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2018-12-03 15:48:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 15:48:45,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:45,120 INFO L402 BasicCegarLoop]: trace histogram [68, 50, 18, 1, 1, 1] [2018-12-03 15:48:45,120 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:45,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:45,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1283148592, now seen corresponding path program 50 times [2018-12-03 15:48:45,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:45,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:45,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:45,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:45,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1968 proven. 400 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:48:46,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:46,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:46,314 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:46,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:46,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:46,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:46,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:46,324 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:46,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 15:48:46,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:46,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:48:46,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:48:46,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:46,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 42 [2018-12-03 15:48:46,856 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:46,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:48:46,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:48:46,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:48:46,857 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 23 states. [2018-12-03 15:48:46,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:46,950 INFO L93 Difference]: Finished difference Result 153 states and 177 transitions. [2018-12-03 15:48:46,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:48:46,951 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 139 [2018-12-03 15:48:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:46,952 INFO L225 Difference]: With dead ends: 153 [2018-12-03 15:48:46,952 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 15:48:46,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:48:46,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 15:48:46,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-12-03 15:48:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 15:48:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 169 transitions. [2018-12-03 15:48:46,958 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 169 transitions. Word has length 139 [2018-12-03 15:48:46,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:46,959 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 169 transitions. [2018-12-03 15:48:46,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:48:46,959 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2018-12-03 15:48:46,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 15:48:46,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:46,960 INFO L402 BasicCegarLoop]: trace histogram [71, 50, 21, 1, 1, 1] [2018-12-03 15:48:46,960 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:46,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:46,961 INFO L82 PathProgramCache]: Analyzing trace with hash -772821089, now seen corresponding path program 51 times [2018-12-03 15:48:46,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:46,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:46,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:46,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:46,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:48,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2256 proven. 529 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:48:48,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:48,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:48,121 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:48,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:48,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:48,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:48,130 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:48,131 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:48,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:48,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:48,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:49,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:51,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:51,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 73, 73] total 102 [2018-12-03 15:48:51,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:51,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 15:48:51,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 15:48:51,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:48:51,663 INFO L87 Difference]: Start difference. First operand 148 states and 169 transitions. Second operand 76 states. [2018-12-03 15:48:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:52,079 INFO L93 Difference]: Finished difference Result 159 states and 186 transitions. [2018-12-03 15:48:52,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 15:48:52,079 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 145 [2018-12-03 15:48:52,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:52,080 INFO L225 Difference]: With dead ends: 159 [2018-12-03 15:48:52,080 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 15:48:52,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 168 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10537 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:48:52,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 15:48:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2018-12-03 15:48:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 15:48:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2018-12-03 15:48:52,085 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 178 transitions. Word has length 145 [2018-12-03 15:48:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:52,086 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 178 transitions. [2018-12-03 15:48:52,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 15:48:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2018-12-03 15:48:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 15:48:52,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:52,087 INFO L402 BasicCegarLoop]: trace histogram [74, 50, 24, 1, 1, 1] [2018-12-03 15:48:52,087 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:52,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:52,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1797188818, now seen corresponding path program 52 times [2018-12-03 15:48:52,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:52,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:52,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:52,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:52,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2544 proven. 676 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:48:52,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:52,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:52,940 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:52,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:52,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:52,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:52,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:52,949 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:53,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:54,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:55,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:55,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 76, 76] total 102 [2018-12-03 15:48:55,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:55,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 15:48:55,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 15:48:55,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:48:55,905 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. Second operand 79 states. [2018-12-03 15:48:56,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:56,359 INFO L93 Difference]: Finished difference Result 165 states and 195 transitions. [2018-12-03 15:48:56,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 15:48:56,360 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 151 [2018-12-03 15:48:56,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:56,361 INFO L225 Difference]: With dead ends: 165 [2018-12-03 15:48:56,361 INFO L226 Difference]: Without dead ends: 161 [2018-12-03 15:48:56,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 177 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11272 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:48:56,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-03 15:48:56,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-12-03 15:48:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 15:48:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 187 transitions. [2018-12-03 15:48:56,367 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 187 transitions. Word has length 151 [2018-12-03 15:48:56,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:56,367 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 187 transitions. [2018-12-03 15:48:56,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 15:48:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2018-12-03 15:48:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 15:48:56,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:56,368 INFO L402 BasicCegarLoop]: trace histogram [77, 50, 27, 1, 1, 1] [2018-12-03 15:48:56,369 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:56,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:56,369 INFO L82 PathProgramCache]: Analyzing trace with hash 882331517, now seen corresponding path program 53 times [2018-12-03 15:48:56,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:56,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:56,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:56,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:56,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2832 proven. 841 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:48:58,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:58,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:58,136 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:58,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:58,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:58,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:58,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:58,144 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:58,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 15:48:58,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:58,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:48:58,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:48:59,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:59,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 52 [2018-12-03 15:48:59,007 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:59,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:48:59,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:48:59,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:59,008 INFO L87 Difference]: Start difference. First operand 160 states and 187 transitions. Second operand 32 states. [2018-12-03 15:48:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:59,211 INFO L93 Difference]: Finished difference Result 171 states and 204 transitions. [2018-12-03 15:48:59,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:48:59,212 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 157 [2018-12-03 15:48:59,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:59,213 INFO L225 Difference]: With dead ends: 171 [2018-12-03 15:48:59,213 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 15:48:59,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 286 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:59,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 15:48:59,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-12-03 15:48:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 15:48:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 196 transitions. [2018-12-03 15:48:59,217 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 196 transitions. Word has length 157 [2018-12-03 15:48:59,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:59,217 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 196 transitions. [2018-12-03 15:48:59,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:48:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 196 transitions. [2018-12-03 15:48:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 15:48:59,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:59,218 INFO L402 BasicCegarLoop]: trace histogram [80, 50, 30, 1, 1, 1] [2018-12-03 15:48:59,218 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:59,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:59,219 INFO L82 PathProgramCache]: Analyzing trace with hash -54733684, now seen corresponding path program 54 times [2018-12-03 15:48:59,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:59,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:59,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:59,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:59,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3120 proven. 1024 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:49:00,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:00,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:00,352 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:00,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:00,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:00,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:00,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:00,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:00,427 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:00,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:00,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:01,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:03,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:03,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 82, 82] total 102 [2018-12-03 15:49:03,421 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:03,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 15:49:03,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 15:49:03,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:49:03,422 INFO L87 Difference]: Start difference. First operand 166 states and 196 transitions. Second operand 85 states. [2018-12-03 15:49:03,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:03,995 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2018-12-03 15:49:03,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 15:49:03,995 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 163 [2018-12-03 15:49:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:03,996 INFO L225 Difference]: With dead ends: 177 [2018-12-03 15:49:03,996 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 15:49:03,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 195 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12742 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:49:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 15:49:04,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-12-03 15:49:04,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 15:49:04,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 205 transitions. [2018-12-03 15:49:04,001 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 205 transitions. Word has length 163 [2018-12-03 15:49:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:04,002 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 205 transitions. [2018-12-03 15:49:04,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 15:49:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 205 transitions. [2018-12-03 15:49:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 15:49:04,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:04,003 INFO L402 BasicCegarLoop]: trace histogram [83, 50, 33, 1, 1, 1] [2018-12-03 15:49:04,003 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:04,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:04,003 INFO L82 PathProgramCache]: Analyzing trace with hash 191369819, now seen corresponding path program 55 times [2018-12-03 15:49:04,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:04,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:04,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:04,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:04,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3408 proven. 1225 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:49:04,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:04,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:04,605 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:04,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:04,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:04,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:04,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:04,615 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:04,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:05,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:07,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:07,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 85, 85] total 102 [2018-12-03 15:49:07,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:07,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 15:49:07,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 15:49:07,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:49:07,530 INFO L87 Difference]: Start difference. First operand 172 states and 205 transitions. Second operand 88 states. [2018-12-03 15:49:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:08,168 INFO L93 Difference]: Finished difference Result 183 states and 222 transitions. [2018-12-03 15:49:08,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 15:49:08,168 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 169 [2018-12-03 15:49:08,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:08,169 INFO L225 Difference]: With dead ends: 183 [2018-12-03 15:49:08,169 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 15:49:08,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 204 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13477 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:49:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 15:49:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-12-03 15:49:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 15:49:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 214 transitions. [2018-12-03 15:49:08,175 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 214 transitions. Word has length 169 [2018-12-03 15:49:08,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:08,175 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 214 transitions. [2018-12-03 15:49:08,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 15:49:08,175 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 214 transitions. [2018-12-03 15:49:08,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 15:49:08,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:08,176 INFO L402 BasicCegarLoop]: trace histogram [86, 50, 36, 1, 1, 1] [2018-12-03 15:49:08,177 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:08,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:08,177 INFO L82 PathProgramCache]: Analyzing trace with hash -803505942, now seen corresponding path program 56 times [2018-12-03 15:49:08,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:08,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:08,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:08,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:08,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3696 proven. 1444 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:49:08,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:08,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:08,861 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:08,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:08,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:08,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:08,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:08,870 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:08,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2018-12-03 15:49:08,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:08,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:49:09,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:49:10,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:10,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39, 39] total 52 [2018-12-03 15:49:10,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:10,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:49:10,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:49:10,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:49:10,014 INFO L87 Difference]: Start difference. First operand 178 states and 214 transitions. Second operand 41 states. [2018-12-03 15:49:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:10,207 INFO L93 Difference]: Finished difference Result 189 states and 231 transitions. [2018-12-03 15:49:10,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:49:10,207 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 175 [2018-12-03 15:49:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:10,208 INFO L225 Difference]: With dead ends: 189 [2018-12-03 15:49:10,208 INFO L226 Difference]: Without dead ends: 185 [2018-12-03 15:49:10,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 313 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:49:10,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-03 15:49:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2018-12-03 15:49:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 15:49:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 223 transitions. [2018-12-03 15:49:10,214 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 223 transitions. Word has length 175 [2018-12-03 15:49:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:10,214 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 223 transitions. [2018-12-03 15:49:10,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:49:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 223 transitions. [2018-12-03 15:49:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 15:49:10,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:10,216 INFO L402 BasicCegarLoop]: trace histogram [89, 50, 39, 1, 1, 1] [2018-12-03 15:49:10,216 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:10,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:10,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1254455353, now seen corresponding path program 57 times [2018-12-03 15:49:10,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:10,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:10,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:10,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:10,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3984 proven. 1681 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:49:10,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:10,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:10,935 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:10,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:10,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:10,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:10,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:10,947 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:11,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:11,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:11,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:11,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:13,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:13,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 91, 91] total 102 [2018-12-03 15:49:13,958 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:13,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 15:49:13,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 15:49:13,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:49:13,960 INFO L87 Difference]: Start difference. First operand 184 states and 223 transitions. Second operand 94 states. [2018-12-03 15:49:14,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:14,643 INFO L93 Difference]: Finished difference Result 195 states and 240 transitions. [2018-12-03 15:49:14,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 15:49:14,643 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 181 [2018-12-03 15:49:14,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:14,644 INFO L225 Difference]: With dead ends: 195 [2018-12-03 15:49:14,644 INFO L226 Difference]: Without dead ends: 191 [2018-12-03 15:49:14,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 222 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14947 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:49:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-03 15:49:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2018-12-03 15:49:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 15:49:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 232 transitions. [2018-12-03 15:49:14,648 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 232 transitions. Word has length 181 [2018-12-03 15:49:14,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:14,648 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 232 transitions. [2018-12-03 15:49:14,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 15:49:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 232 transitions. [2018-12-03 15:49:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 15:49:14,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:14,649 INFO L402 BasicCegarLoop]: trace histogram [92, 50, 42, 1, 1, 1] [2018-12-03 15:49:14,649 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:14,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:14,650 INFO L82 PathProgramCache]: Analyzing trace with hash 180387912, now seen corresponding path program 58 times [2018-12-03 15:49:14,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:14,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:14,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4272 proven. 1936 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:49:15,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:15,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:15,994 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:15,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:15,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:15,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:16,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:16,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:16,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:17,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:19,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:19,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 94, 94] total 102 [2018-12-03 15:49:19,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:19,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 15:49:19,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 15:49:19,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:49:19,098 INFO L87 Difference]: Start difference. First operand 190 states and 232 transitions. Second operand 97 states. [2018-12-03 15:49:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:19,936 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2018-12-03 15:49:19,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 15:49:19,936 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 187 [2018-12-03 15:49:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:19,938 INFO L225 Difference]: With dead ends: 201 [2018-12-03 15:49:19,938 INFO L226 Difference]: Without dead ends: 197 [2018-12-03 15:49:19,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 231 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15682 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:49:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-03 15:49:19,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-12-03 15:49:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 15:49:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 241 transitions. [2018-12-03 15:49:19,943 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 241 transitions. Word has length 187 [2018-12-03 15:49:19,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:19,944 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 241 transitions. [2018-12-03 15:49:19,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 15:49:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 241 transitions. [2018-12-03 15:49:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 15:49:19,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:19,945 INFO L402 BasicCegarLoop]: trace histogram [95, 50, 45, 1, 1, 1] [2018-12-03 15:49:19,945 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:19,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:19,946 INFO L82 PathProgramCache]: Analyzing trace with hash -304938729, now seen corresponding path program 59 times [2018-12-03 15:49:19,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:19,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:19,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:19,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:19,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 2209 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:49:20,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:20,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:20,865 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:20,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:20,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:20,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:20,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:20,875 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:21,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 92 check-sat command(s) [2018-12-03 15:49:21,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:21,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:49:21,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:49:22,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:22,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48, 48] total 52 [2018-12-03 15:49:22,024 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:22,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:49:22,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:49:22,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:49:22,025 INFO L87 Difference]: Start difference. First operand 196 states and 241 transitions. Second operand 50 states. [2018-12-03 15:49:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:22,333 INFO L93 Difference]: Finished difference Result 207 states and 258 transitions. [2018-12-03 15:49:22,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:49:22,334 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 193 [2018-12-03 15:49:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:22,336 INFO L225 Difference]: With dead ends: 207 [2018-12-03 15:49:22,336 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 15:49:22,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 340 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:49:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 15:49:22,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-12-03 15:49:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 15:49:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 250 transitions. [2018-12-03 15:49:22,343 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 250 transitions. Word has length 193 [2018-12-03 15:49:22,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:22,343 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 250 transitions. [2018-12-03 15:49:22,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:49:22,344 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 250 transitions. [2018-12-03 15:49:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 15:49:22,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:22,345 INFO L402 BasicCegarLoop]: trace histogram [98, 50, 48, 1, 1, 1] [2018-12-03 15:49:22,345 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:22,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:22,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1624282458, now seen corresponding path program 60 times [2018-12-03 15:49:22,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:22,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:22,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:22,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:22,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4850 proven. 2304 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:49:23,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:23,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:23,603 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:23,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:23,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:23,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:23,612 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:23,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:23,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:23,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:23,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:24,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:26,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:26,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 100, 100] total 102 [2018-12-03 15:49:26,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:26,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 15:49:26,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 15:49:26,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:49:26,673 INFO L87 Difference]: Start difference. First operand 202 states and 250 transitions. Second operand 101 states. [2018-12-03 15:49:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:27,470 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2018-12-03 15:49:27,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 15:49:27,471 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2018-12-03 15:49:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:27,472 INFO L225 Difference]: With dead ends: 209 [2018-12-03 15:49:27,472 INFO L226 Difference]: Without dead ends: 205 [2018-12-03 15:49:27,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 249 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16953 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:49:27,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-03 15:49:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-12-03 15:49:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-03 15:49:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 253 transitions. [2018-12-03 15:49:27,477 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 253 transitions. Word has length 199 [2018-12-03 15:49:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:27,478 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 253 transitions. [2018-12-03 15:49:27,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 15:49:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 253 transitions. [2018-12-03 15:49:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-03 15:49:27,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:27,479 INFO L402 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1] [2018-12-03 15:49:27,479 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:27,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:27,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1862555477, now seen corresponding path program 61 times [2018-12-03 15:49:27,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:27,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:27,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:27,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:27,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:49:28,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:28,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:28,741 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:28,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:28,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:28,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:28,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:28,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:28,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:30,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:32,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:32,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 101, 101] total 102 [2018-12-03 15:49:32,468 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:32,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 15:49:32,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 15:49:32,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:49:32,469 INFO L87 Difference]: Start difference. First operand 204 states and 253 transitions. Second operand 102 states. [2018-12-03 15:49:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:33,373 INFO L93 Difference]: Finished difference Result 210 states and 260 transitions. [2018-12-03 15:49:33,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 15:49:33,374 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2018-12-03 15:49:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:33,375 INFO L225 Difference]: With dead ends: 210 [2018-12-03 15:49:33,375 INFO L226 Difference]: Without dead ends: 206 [2018-12-03 15:49:33,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 252 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17200 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:49:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-03 15:49:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-12-03 15:49:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-03 15:49:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 256 transitions. [2018-12-03 15:49:33,381 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 256 transitions. Word has length 201 [2018-12-03 15:49:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:33,382 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 256 transitions. [2018-12-03 15:49:33,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 15:49:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 256 transitions. [2018-12-03 15:49:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-03 15:49:33,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:33,383 INFO L402 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1] [2018-12-03 15:49:33,383 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:33,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:33,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1085307248, now seen corresponding path program 62 times [2018-12-03 15:49:33,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:33,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:33,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:33,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:33,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 7450 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 15:49:34,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:49:34,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2018-12-03 15:49:34,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:49:34,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:49:34,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:49:34,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:49:34,704 INFO L87 Difference]: Start difference. First operand 206 states and 256 transitions. Second operand 53 states. [2018-12-03 15:49:34,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:34,918 INFO L93 Difference]: Finished difference Result 2756 states and 4081 transitions. [2018-12-03 15:49:34,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:49:34,918 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 203 [2018-12-03 15:49:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:34,929 INFO L225 Difference]: With dead ends: 2756 [2018-12-03 15:49:34,929 INFO L226 Difference]: Without dead ends: 2755 [2018-12-03 15:49:34,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:49:34,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2018-12-03 15:49:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 205. [2018-12-03 15:49:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-03 15:49:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 255 transitions. [2018-12-03 15:49:34,985 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 255 transitions. Word has length 203 [2018-12-03 15:49:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:34,985 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 255 transitions. [2018-12-03 15:49:34,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:49:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 255 transitions. [2018-12-03 15:49:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 15:49:34,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:34,987 INFO L402 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1, 1] [2018-12-03 15:49:34,987 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:34,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:34,987 INFO L82 PathProgramCache]: Analyzing trace with hash -715213634, now seen corresponding path program 1 times [2018-12-03 15:49:34,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:34,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:34,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:34,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:34,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 15:49:36,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:36,282 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:36,282 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-12-03 15:49:36,282 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [14], [15] [2018-12-03 15:49:36,283 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:49:36,283 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:49:36,335 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:49:36,335 INFO L272 AbstractInterpreter]: Visited 7 different actions 35 times. Merged at 5 different actions 16 times. Widened at 1 different actions 2 times. Found 8 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:49:36,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:36,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:49:36,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:36,355 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:36,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:36,365 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:36,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 15:49:36,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 15:49:37,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:37,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 15:49:37,419 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:37,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:49:37,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:49:37,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:49:37,420 INFO L87 Difference]: Start difference. First operand 205 states and 255 transitions. Second operand 53 states. [2018-12-03 15:49:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:38,379 INFO L93 Difference]: Finished difference Result 2859 states and 4234 transitions. [2018-12-03 15:49:38,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:49:38,380 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 204 [2018-12-03 15:49:38,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:38,390 INFO L225 Difference]: With dead ends: 2859 [2018-12-03 15:49:38,390 INFO L226 Difference]: Without dead ends: 2856 [2018-12-03 15:49:38,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 356 SyntacticMatches, 50 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:49:38,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2018-12-03 15:49:38,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 207. [2018-12-03 15:49:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 15:49:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 258 transitions. [2018-12-03 15:49:38,479 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 258 transitions. Word has length 204 [2018-12-03 15:49:38,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:38,480 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 258 transitions. [2018-12-03 15:49:38,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:49:38,480 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 258 transitions. [2018-12-03 15:49:38,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-03 15:49:38,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:38,481 INFO L402 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1] [2018-12-03 15:49:38,481 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:38,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:38,482 INFO L82 PathProgramCache]: Analyzing trace with hash -133074471, now seen corresponding path program 2 times [2018-12-03 15:49:38,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:38,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:38,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:38,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:38,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 15:49:39,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:49:39,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-12-03 15:49:39,748 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:49:39,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:49:39,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:49:39,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:49:39,749 INFO L87 Difference]: Start difference. First operand 207 states and 258 transitions. Second operand 52 states. [2018-12-03 15:49:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:40,416 INFO L93 Difference]: Finished difference Result 306 states and 406 transitions. [2018-12-03 15:49:40,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:49:40,417 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 206 [2018-12-03 15:49:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:40,417 INFO L225 Difference]: With dead ends: 306 [2018-12-03 15:49:40,417 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:49:40,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:49:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:49:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:49:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:49:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:49:40,419 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2018-12-03 15:49:40,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:40,420 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:49:40,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:49:40,420 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:49:40,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:49:40,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:49:58,224 WARN L180 SmtUtils]: Spent 17.78 s on a formula simplification. DAG size of input: 3207 DAG size of output: 3056 [2018-12-03 15:51:02,868 WARN L180 SmtUtils]: Spent 1.08 m on a formula simplification. DAG size of input: 3056 DAG size of output: 407 [2018-12-03 15:51:02,873 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 11 26) no Hoare annotation was computed. [2018-12-03 15:51:02,873 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONASSERT(line 25) no Hoare annotation was computed. [2018-12-03 15:51:02,873 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-03 15:51:02,873 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 26) no Hoare annotation was computed. [2018-12-03 15:51:02,873 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-12-03 15:51:02,873 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 21) no Hoare annotation was computed. [2018-12-03 15:51:02,873 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 24) no Hoare annotation was computed. [2018-12-03 15:51:02,875 INFO L444 ceAbstractionStarter]: At program point L16-2(lines 15 22) the Hoare annotation is: (or (and (<= 83 x) (and (<= y 83) (and (<= x 83) (<= 83 y)))) (and (and (and (<= x 71) (<= 71 y)) (<= y 71)) (<= 71 x)) (and (and (<= y 75) (and (<= x 75) (<= 75 y))) (<= 75 x)) (and (<= 68 x) (and (and (<= 68 y) (<= x 68)) (<= y 68))) (and (<= 82 x) (and (and (<= x 82) (<= 82 y)) (<= y 82))) (and (<= 92 x) (and (<= y 92) (and (<= 92 y) (<= x 92)))) (and (<= 88 x) (and (and (<= x 88) (<= 88 y)) (<= y 88))) (and (<= 57 x) (and (and (<= x 57) (<= 57 y)) (<= y 57))) (and (and (<= y 58) (and (<= 58 y) (<= x 58))) (<= 58 x)) (and (and (<= y 91) (and (<= 91 y) (<= x 91))) (<= 91 x)) (and (<= 74 x) (and (and (<= x 74) (<= 74 y)) (<= y 74))) (and (and (and (<= x 72) (<= 72 y)) (<= y 72)) (<= 72 x)) (and (<= 87 x) (and (<= y 87) (and (<= 87 y) (<= x 87)))) (and (and (and (<= 60 y) (<= x 60)) (<= y 60)) (<= 60 x)) (and (and (and (<= x 76) (<= 76 y)) (<= y 76)) (<= 76 x)) (and (<= 56 x) (and (and (<= x 56) (<= 56 y)) (<= y 56))) (and (<= 100 x) (and (<= 100 y) (<= y 100))) (and (<= 53 x) (and (and (<= 53 y) (<= x 53)) (<= y 53))) (and (<= 86 x) (and (<= y 86) (and (<= 86 y) (<= x 86)))) (and (and (<= y 79) (and (<= 79 y) (<= x 79))) (<= 79 x)) (and (and (and (<= 99 y) (<= x 99)) (<= y 99)) (<= 99 x)) (and (and (<= y 78) (and (<= 78 y) (<= x 78))) (<= 78 x)) (and (and (<= y 63) (and (<= 63 y) (<= x 63))) (<= 63 x)) (and (and (and (<= x 94) (<= 94 y)) (<= y 94)) (<= 94 x)) (and (and (<= y 55) (and (<= x 55) (<= 55 y))) (<= 55 x)) (and (<= 70 x) (and (and (<= 70 y) (<= x 70)) (<= y 70))) (and (<= 85 x) (and (<= y 85) (and (<= 85 y) (<= x 85)))) (and (<= 54 x) (and (and (<= x 54) (<= 54 y)) (<= y 54))) (and (and (and (<= x 89) (<= 89 y)) (<= y 89)) (<= 89 x)) (and (and (and (<= 69 y) (<= x 69)) (<= y 69)) (<= 69 x)) (and (<= 64 x) (and (<= y 64) (and (<= 64 y) (<= x 64)))) (and (and (and (<= x 59) (<= 59 y)) (<= y 59)) (<= 59 x)) (and (and (and (<= 97 y) (<= x 97)) (<= y 97)) (<= 97 x)) (and (<= 52 x) (and (and (<= 52 y) (<= x 52)) (<= y 52))) (and (<= 61 x) (and (<= y 61) (and (<= 61 y) (<= x 61)))) (and (<= 84 x) (and (and (<= x 84) (<= 84 y)) (<= y 84))) (and (<= 80 x) (and (<= y 80) (and (<= x 80) (<= 80 y)))) (and (<= 95 x) (and (<= y 95) (and (<= x 95) (<= 95 y)))) (and (and (<= y 65) (and (<= 65 y) (<= x 65))) (<= 65 x)) (and (and (<= y 77) (and (<= 77 y) (<= x 77))) (<= 77 x)) (and (and (<= y 90) (and (<= x 90) (<= 90 y))) (<= 90 x)) (and (<= 51 x) (and (and (<= x 51) (<= 51 y)) (<= y 51))) (and (<= 73 x) (and (<= y 73) (and (<= x 73) (<= 73 y)))) (and (and (and (<= x 93) (<= 93 y)) (<= y 93)) (<= 93 x)) (and (and (<= y 81) (and (<= x 81) (<= 81 y))) (<= 81 x)) (and (and (and (<= 67 y) (<= x 67)) (<= y 67)) (<= 67 x)) (and (<= 62 x) (and (<= y 62) (and (<= 62 y) (<= x 62)))) (and (<= 98 x) (and (<= y 98) (and (<= x 98) (<= 98 y)))) (and (<= y 50) (and (<= 50 y) (<= x 50))) (and (<= 96 x) (and (<= y 96) (and (<= 96 y) (<= x 96)))) (and (and (and (<= x 66) (<= 66 y)) (<= y 66)) (<= 66 x))) [2018-12-03 15:51:02,875 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 26) no Hoare annotation was computed. [2018-12-03 15:51:02,898 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:51:02 BoogieIcfgContainer [2018-12-03 15:51:02,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:51:02,899 INFO L168 Benchmark]: Toolchain (without parser) took 222685.34 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-12-03 15:51:02,900 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:51:02,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:51:02,901 INFO L168 Benchmark]: Boogie Preprocessor took 27.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:51:02,901 INFO L168 Benchmark]: RCFGBuilder took 243.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:51:02,901 INFO L168 Benchmark]: TraceAbstraction took 222367.96 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-12-03 15:51:02,904 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 243.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 222367.96 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 24]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((83 <= x && y <= 83 && x <= 83 && 83 <= y) || (((x <= 71 && 71 <= y) && y <= 71) && 71 <= x)) || ((y <= 75 && x <= 75 && 75 <= y) && 75 <= x)) || (68 <= x && (68 <= y && x <= 68) && y <= 68)) || (82 <= x && (x <= 82 && 82 <= y) && y <= 82)) || (92 <= x && y <= 92 && 92 <= y && x <= 92)) || (88 <= x && (x <= 88 && 88 <= y) && y <= 88)) || (57 <= x && (x <= 57 && 57 <= y) && y <= 57)) || ((y <= 58 && 58 <= y && x <= 58) && 58 <= x)) || ((y <= 91 && 91 <= y && x <= 91) && 91 <= x)) || (74 <= x && (x <= 74 && 74 <= y) && y <= 74)) || (((x <= 72 && 72 <= y) && y <= 72) && 72 <= x)) || (87 <= x && y <= 87 && 87 <= y && x <= 87)) || (((60 <= y && x <= 60) && y <= 60) && 60 <= x)) || (((x <= 76 && 76 <= y) && y <= 76) && 76 <= x)) || (56 <= x && (x <= 56 && 56 <= y) && y <= 56)) || (100 <= x && 100 <= y && y <= 100)) || (53 <= x && (53 <= y && x <= 53) && y <= 53)) || (86 <= x && y <= 86 && 86 <= y && x <= 86)) || ((y <= 79 && 79 <= y && x <= 79) && 79 <= x)) || (((99 <= y && x <= 99) && y <= 99) && 99 <= x)) || ((y <= 78 && 78 <= y && x <= 78) && 78 <= x)) || ((y <= 63 && 63 <= y && x <= 63) && 63 <= x)) || (((x <= 94 && 94 <= y) && y <= 94) && 94 <= x)) || ((y <= 55 && x <= 55 && 55 <= y) && 55 <= x)) || (70 <= x && (70 <= y && x <= 70) && y <= 70)) || (85 <= x && y <= 85 && 85 <= y && x <= 85)) || (54 <= x && (x <= 54 && 54 <= y) && y <= 54)) || (((x <= 89 && 89 <= y) && y <= 89) && 89 <= x)) || (((69 <= y && x <= 69) && y <= 69) && 69 <= x)) || (64 <= x && y <= 64 && 64 <= y && x <= 64)) || (((x <= 59 && 59 <= y) && y <= 59) && 59 <= x)) || (((97 <= y && x <= 97) && y <= 97) && 97 <= x)) || (52 <= x && (52 <= y && x <= 52) && y <= 52)) || (61 <= x && y <= 61 && 61 <= y && x <= 61)) || (84 <= x && (x <= 84 && 84 <= y) && y <= 84)) || (80 <= x && y <= 80 && x <= 80 && 80 <= y)) || (95 <= x && y <= 95 && x <= 95 && 95 <= y)) || ((y <= 65 && 65 <= y && x <= 65) && 65 <= x)) || ((y <= 77 && 77 <= y && x <= 77) && 77 <= x)) || ((y <= 90 && x <= 90 && 90 <= y) && 90 <= x)) || (51 <= x && (x <= 51 && 51 <= y) && y <= 51)) || (73 <= x && y <= 73 && x <= 73 && 73 <= y)) || (((x <= 93 && 93 <= y) && y <= 93) && 93 <= x)) || ((y <= 81 && x <= 81 && 81 <= y) && 81 <= x)) || (((67 <= y && x <= 67) && y <= 67) && 67 <= x)) || (62 <= x && y <= 62 && 62 <= y && x <= 62)) || (98 <= x && y <= 98 && x <= 98 && 98 <= y)) || (y <= 50 && 50 <= y && x <= 50)) || (96 <= x && y <= 96 && 96 <= y && x <= 96)) || (((x <= 66 && 66 <= y) && y <= 66) && 66 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 2 error locations. SAFE Result, 222.2s OverallTime, 66 OverallIterations, 101 TraceHistogramMax, 19.4s AutomataDifference, 0.0s DeadEndRemovalTime, 82.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 464 SDtfs, 1688 SDslu, 3389 SDs, 0 SdLazy, 7221 SolverSat, 2416 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13508 GetRequests, 9157 SyntacticMatches, 1178 SemanticMatches, 3173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126943 ImplicationChecksByTransitivity, 110.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 66 MinimizatonAttempts, 5227 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 758 HoareAnnotationTreeSize, 1 FomulaSimplifications, 669 FormulaSimplificationTreeSizeReduction, 17.7s HoareSimplificationTime, 1 FomulaSimplificationsInter, 334056 FormulaSimplificationTreeSizeReductionInter, 64.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 113.5s InterpolantComputationTime, 12096 NumberOfCodeBlocks, 11506 NumberOfCodeBlocksAsserted, 723 NumberOfCheckSat, 17746 ConstructedInterpolants, 0 QuantifiedInterpolants, 5296220 SizeOfPredicates, 50 NumberOfNonLiveVariables, 12529 ConjunctsInSsa, 1994 ConjunctsInUnsatCore, 192 InterpolantComputations, 5 PerfectInterpolantSequences, 272906/542273 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...