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/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:10:22,656 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:10:22,658 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:10:22,674 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:10:22,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:10:22,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:10:22,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:10:22,679 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:10:22,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:10:22,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:10:22,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:10:22,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:10:22,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:10:22,684 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:10:22,685 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:10:22,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:10:22,687 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:10:22,689 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:10:22,691 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:10:22,693 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:10:22,694 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:10:22,695 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:10:22,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:10:22,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:10:22,699 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:10:22,700 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:10:22,703 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:10:22,704 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:10:22,705 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:10:22,706 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:10:22,706 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:10:22,707 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:10:22,707 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:10:22,707 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:10:22,709 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:10:22,709 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:10:22,710 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 [2019-02-28 10:10:22,722 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:10:22,723 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:10:22,723 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:10:22,723 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:10:22,724 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:10:22,724 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:10:22,724 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:10:22,724 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:10:22,724 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 10:10:22,725 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:10:22,725 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 10:10:22,725 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 10:10:22,725 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:10:22,725 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:10:22,726 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:10:22,726 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:10:22,727 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:10:22,727 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:10:22,727 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:10:22,727 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:10:22,727 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:10:22,727 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:10:22,728 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:10:22,728 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:10:22,728 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:10:22,728 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:10:22,728 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:10:22,729 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:10:22,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:10:22,729 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:10:22,729 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:10:22,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:22,730 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:10:22,730 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:10:22,730 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:10:22,730 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:10:22,730 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:10:22,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:10:22,731 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:10:22,731 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:10:22,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:10:22,779 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:10:22,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:10:22,785 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:10:22,786 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:10:22,787 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-02-28 10:10:22,787 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-02-28 10:10:22,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:10:22,832 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:10:22,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:22,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:10:22,833 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:10:22,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:22" (1/1) ... [2019-02-28 10:10:22,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:22" (1/1) ... [2019-02-28 10:10:22,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:22,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:10:22,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:10:22,872 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:10:22,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:22" (1/1) ... [2019-02-28 10:10:22,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:22" (1/1) ... [2019-02-28 10:10:22,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:22" (1/1) ... [2019-02-28 10:10:22,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:22" (1/1) ... [2019-02-28 10:10:22,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:22" (1/1) ... [2019-02-28 10:10:22,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:22" (1/1) ... [2019-02-28 10:10:22,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:22" (1/1) ... [2019-02-28 10:10:22,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:10:22,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:10:22,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:10:22,901 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:10:22,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:22" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:22,976 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-02-28 10:10:22,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:10:22,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:10:23,174 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:10:23,175 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-28 10:10:23,177 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:23 BoogieIcfgContainer [2019-02-28 10:10:23,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:10:23,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:10:23,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:10:23,181 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:10:23,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:22" (1/2) ... [2019-02-28 10:10:23,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393a8580 and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:10:23, skipping insertion in model container [2019-02-28 10:10:23,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:23" (2/2) ... [2019-02-28 10:10:23,185 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-02-28 10:10:23,195 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:10:23,206 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 10:10:23,223 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 10:10:23,259 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:10:23,259 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:10:23,259 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:10:23,259 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:10:23,260 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:10:23,260 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:10:23,260 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:10:23,260 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:10:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-02-28 10:10:23,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:10:23,288 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:23,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:10:23,295 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:23,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:23,301 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-02-28 10:10:23,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:23,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:23,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:23,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:23,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:23,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:10:23,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:10:23,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:23,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:10:23,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:10:23,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:10:23,572 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-02-28 10:10:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:23,749 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-02-28 10:10:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:10:23,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-28 10:10:23,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:23,762 INFO L225 Difference]: With dead ends: 26 [2019-02-28 10:10:23,762 INFO L226 Difference]: Without dead ends: 13 [2019-02-28 10:10:23,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:10:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-28 10:10:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-02-28 10:10:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 10:10:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-02-28 10:10:23,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-02-28 10:10:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:23,812 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-02-28 10:10:23,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:10:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-02-28 10:10:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:10:23,813 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:23,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:10:23,813 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:23,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:23,814 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-02-28 10:10:23,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:23,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:23,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:23,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:23,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:23,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:10:23,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-02-28 10:10:23,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:23,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:10:23,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:10:23,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:10:23,917 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-02-28 10:10:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:24,040 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-02-28 10:10:24,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:10:24,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-02-28 10:10:24,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:24,042 INFO L225 Difference]: With dead ends: 25 [2019-02-28 10:10:24,043 INFO L226 Difference]: Without dead ends: 23 [2019-02-28 10:10:24,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:10:24,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-28 10:10:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-02-28 10:10:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-28 10:10:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-02-28 10:10:24,050 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-02-28 10:10:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:24,050 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-02-28 10:10:24,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:10:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-02-28 10:10:24,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:10:24,051 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:24,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:10:24,052 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:24,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:24,053 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-02-28 10:10:24,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:24,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:24,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:10:24,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:10:24,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:10:24,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:24,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:10:24,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:10:24,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:10:24,097 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-02-28 10:10:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:24,154 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-02-28 10:10:24,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:10:24,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-02-28 10:10:24,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:24,155 INFO L225 Difference]: With dead ends: 24 [2019-02-28 10:10:24,156 INFO L226 Difference]: Without dead ends: 13 [2019-02-28 10:10:24,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:10:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-28 10:10:24,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-02-28 10:10:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 10:10:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-02-28 10:10:24,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-02-28 10:10:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:24,160 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-02-28 10:10:24,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:10:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-28 10:10:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:10:24,161 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:24,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:10:24,161 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:24,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-02-28 10:10:24,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:24,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:24,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:24,403 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-02-28 10:10:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:24,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:24,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:24,631 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:10:24,632 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-02-28 10:10:24,675 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:10:24,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:10:24,821 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:10:24,822 INFO L272 AbstractInterpreter]: Visited 9 different actions 29 times. Merged at 8 different actions 18 times. Widened at 1 different actions 1 times. Performed 110 root evaluator evaluations with a maximum evaluation depth of 3. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:10:24,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:24,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:10:24,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:24,830 INFO L193 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 [2019-02-28 10:10:24,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:24,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:24,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:10:24,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:25,155 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:25,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:25,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-02-28 10:10:25,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:25,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:10:25,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:10:25,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:10:25,271 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-02-28 10:10:25,769 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-02-28 10:10:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:25,793 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-02-28 10:10:25,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:10:25,795 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-02-28 10:10:25,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:25,796 INFO L225 Difference]: With dead ends: 26 [2019-02-28 10:10:25,796 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:10:25,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:10:25,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:10:25,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-02-28 10:10:25,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-28 10:10:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-02-28 10:10:25,801 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-02-28 10:10:25,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:25,801 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-02-28 10:10:25,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:10:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-02-28 10:10:25,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-28 10:10:25,802 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:25,803 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:10:25,803 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:25,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:25,803 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-02-28 10:10:25,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:25,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:25,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:25,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:25,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:25,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:25,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:25,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-02-28 10:10:25,889 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-02-28 10:10:25,891 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:10:25,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:10:25,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:10:25,939 INFO L272 AbstractInterpreter]: Visited 12 different actions 41 times. Merged at 11 different actions 22 times. Widened at 1 different actions 1 times. Performed 147 root evaluator evaluations with a maximum evaluation depth of 4. Performed 147 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 7 different actions. Largest state had 0 variables. [2019-02-28 10:10:25,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:25,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:10:25,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:25,940 INFO L193 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 [2019-02-28 10:10:25,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:25,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:25,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:10:25,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:26,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:26,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:26,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:26,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-02-28 10:10:26,105 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:26,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:10:26,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:10:26,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:10:26,107 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-02-28 10:10:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:26,469 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-02-28 10:10:26,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:10:26,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-02-28 10:10:26,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:26,471 INFO L225 Difference]: With dead ends: 31 [2019-02-28 10:10:26,471 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:10:26,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:10:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:10:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-02-28 10:10:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:10:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-02-28 10:10:26,476 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-02-28 10:10:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:26,476 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-02-28 10:10:26,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:10:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-02-28 10:10:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-28 10:10:26,477 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:26,477 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:10:26,477 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:26,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:26,478 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-02-28 10:10:26,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:26,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:26,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:26,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:26,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:26,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:26,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:26,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:26,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:26,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:26,755 INFO L193 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 [2019-02-28 10:10:26,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:26,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:26,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:10:26,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:26,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:10:26,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:26,894 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:26,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:26,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-02-28 10:10:26,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:26,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:10:26,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:10:26,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:10:26,981 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-02-28 10:10:27,316 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-02-28 10:10:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:27,336 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-02-28 10:10:27,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:10:27,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-02-28 10:10:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:27,338 INFO L225 Difference]: With dead ends: 35 [2019-02-28 10:10:27,338 INFO L226 Difference]: Without dead ends: 28 [2019-02-28 10:10:27,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:10:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-28 10:10:27,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-02-28 10:10:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-28 10:10:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-02-28 10:10:27,344 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-02-28 10:10:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:27,345 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-02-28 10:10:27,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:10:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-02-28 10:10:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-28 10:10:27,346 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:27,346 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-28 10:10:27,346 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:27,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:27,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-02-28 10:10:27,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:27,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:27,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:27,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:27,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:27,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:27,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:27,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:27,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:27,459 INFO L193 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 [2019-02-28 10:10:27,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:27,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:27,476 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:27,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:27,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:10:27,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:27,547 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:27,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:27,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-02-28 10:10:27,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:27,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:10:27,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:10:27,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:10:27,588 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-02-28 10:10:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:27,704 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-02-28 10:10:27,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:10:27,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-28 10:10:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:27,705 INFO L225 Difference]: With dead ends: 45 [2019-02-28 10:10:27,705 INFO L226 Difference]: Without dead ends: 26 [2019-02-28 10:10:27,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:10:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-28 10:10:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-02-28 10:10:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-28 10:10:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-02-28 10:10:27,711 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-02-28 10:10:27,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:27,712 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-02-28 10:10:27,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:10:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-02-28 10:10:27,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-28 10:10:27,713 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:27,713 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-28 10:10:27,713 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:27,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:27,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-02-28 10:10:27,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:27,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:27,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:27,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:27,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:27,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:27,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:27,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:27,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:27,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:27,956 INFO L193 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 [2019-02-28 10:10:27,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:27,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:27,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:10:27,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:28,174 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:28,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:28,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-02-28 10:10:28,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:28,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:10:28,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:10:28,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:10:28,318 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-02-28 10:10:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:28,694 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-02-28 10:10:28,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-28 10:10:28,697 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-02-28 10:10:28,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:28,698 INFO L225 Difference]: With dead ends: 49 [2019-02-28 10:10:28,698 INFO L226 Difference]: Without dead ends: 39 [2019-02-28 10:10:28,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:10:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-28 10:10:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-02-28 10:10:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-28 10:10:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-02-28 10:10:28,704 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-02-28 10:10:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:28,705 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-02-28 10:10:28,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:10:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-02-28 10:10:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-28 10:10:28,706 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:28,706 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-28 10:10:28,706 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:28,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:28,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-02-28 10:10:28,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:28,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:28,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:28,801 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:28,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:28,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:28,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:28,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:28,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:28,802 INFO L193 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 [2019-02-28 10:10:28,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:28,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:28,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-28 10:10:28,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:28,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:10:28,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:28,898 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:29,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:29,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-02-28 10:10:29,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:29,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:10:29,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:10:29,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:10:29,031 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-02-28 10:10:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:29,345 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-02-28 10:10:29,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:10:29,346 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-02-28 10:10:29,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:29,347 INFO L225 Difference]: With dead ends: 60 [2019-02-28 10:10:29,347 INFO L226 Difference]: Without dead ends: 33 [2019-02-28 10:10:29,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:10:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-28 10:10:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-02-28 10:10:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-28 10:10:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-02-28 10:10:29,354 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-02-28 10:10:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:29,355 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-02-28 10:10:29,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:10:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-02-28 10:10:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-28 10:10:29,356 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:29,356 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-28 10:10:29,356 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:29,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:29,356 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-02-28 10:10:29,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:29,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:29,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:29,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:29,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:29,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:29,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:29,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:29,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:29,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:29,627 INFO L193 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 [2019-02-28 10:10:29,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:29,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:29,641 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:29,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:29,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-28 10:10:29,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:29,782 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:29,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:29,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-02-28 10:10:29,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:29,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-28 10:10:29,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-28 10:10:29,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:10:29,848 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-02-28 10:10:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:30,576 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-02-28 10:10:30,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-28 10:10:30,579 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-02-28 10:10:30,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:30,580 INFO L225 Difference]: With dead ends: 64 [2019-02-28 10:10:30,580 INFO L226 Difference]: Without dead ends: 50 [2019-02-28 10:10:30,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-02-28 10:10:30,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-28 10:10:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-02-28 10:10:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-28 10:10:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-02-28 10:10:30,587 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-02-28 10:10:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:30,587 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-02-28 10:10:30,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-28 10:10:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-02-28 10:10:30,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-28 10:10:30,588 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:30,588 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-28 10:10:30,589 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:30,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:30,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-02-28 10:10:30,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:30,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:30,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:30,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:30,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:30,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:30,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:30,781 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:30,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:30,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:30,781 INFO L193 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 [2019-02-28 10:10:30,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:30,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:30,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-28 10:10:30,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:31,361 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:31,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:31,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-02-28 10:10:31,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:31,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-28 10:10:31,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-28 10:10:31,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:10:31,428 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-02-28 10:10:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:31,754 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-02-28 10:10:31,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:10:31,754 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-02-28 10:10:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:31,756 INFO L225 Difference]: With dead ends: 75 [2019-02-28 10:10:31,756 INFO L226 Difference]: Without dead ends: 40 [2019-02-28 10:10:31,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:10:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-28 10:10:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-02-28 10:10:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-28 10:10:31,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-02-28 10:10:31,764 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-02-28 10:10:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:31,765 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-02-28 10:10:31,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-28 10:10:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-02-28 10:10:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-28 10:10:31,766 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:31,766 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-28 10:10:31,766 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:31,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:31,767 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-02-28 10:10:31,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:31,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:31,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:31,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:31,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:32,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:32,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:32,022 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:32,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:32,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:32,023 INFO L193 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 [2019-02-28 10:10:32,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:32,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:32,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-28 10:10:32,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:32,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-28 10:10:32,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:32,449 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:33,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:33,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-02-28 10:10:33,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:33,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-28 10:10:33,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-28 10:10:33,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:10:33,229 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-02-28 10:10:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:35,378 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-02-28 10:10:35,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-28 10:10:35,378 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-02-28 10:10:35,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:35,379 INFO L225 Difference]: With dead ends: 97 [2019-02-28 10:10:35,379 INFO L226 Difference]: Without dead ends: 58 [2019-02-28 10:10:35,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:10:35,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-28 10:10:35,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-02-28 10:10:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-28 10:10:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-02-28 10:10:35,389 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-02-28 10:10:35,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:35,389 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-02-28 10:10:35,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-28 10:10:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-02-28 10:10:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-28 10:10:35,390 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:35,390 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-02-28 10:10:35,390 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:35,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:35,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-02-28 10:10:35,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:35,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:35,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:35,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:35,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:35,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:35,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:35,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:35,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:35,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:35,791 INFO L193 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 [2019-02-28 10:10:35,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:35,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:35,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:35,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:35,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-28 10:10:35,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:36,115 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:36,115 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:36,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:36,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-02-28 10:10:36,165 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:36,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-28 10:10:36,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-28 10:10:36,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:10:36,167 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-02-28 10:10:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:37,444 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-02-28 10:10:37,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-28 10:10:37,445 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-28 10:10:37,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:37,446 INFO L225 Difference]: With dead ends: 94 [2019-02-28 10:10:37,446 INFO L226 Difference]: Without dead ends: 72 [2019-02-28 10:10:37,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-02-28 10:10:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-28 10:10:37,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-02-28 10:10:37,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-28 10:10:37,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-02-28 10:10:37,455 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-02-28 10:10:37,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:37,456 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-02-28 10:10:37,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-28 10:10:37,456 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-02-28 10:10:37,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-28 10:10:37,457 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:37,457 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-28 10:10:37,457 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:37,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:37,457 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-02-28 10:10:37,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:37,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:37,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:37,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:37,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:37,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:37,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:37,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:37,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:37,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:37,617 INFO L193 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 [2019-02-28 10:10:37,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:37,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:37,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-28 10:10:37,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:37,827 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:37,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:37,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-02-28 10:10:37,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:37,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-28 10:10:37,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-28 10:10:37,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:10:37,934 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-02-28 10:10:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:38,251 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-02-28 10:10:38,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-28 10:10:38,252 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-02-28 10:10:38,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:38,253 INFO L225 Difference]: With dead ends: 105 [2019-02-28 10:10:38,253 INFO L226 Difference]: Without dead ends: 54 [2019-02-28 10:10:38,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:10:38,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-28 10:10:38,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-02-28 10:10:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-28 10:10:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-02-28 10:10:38,264 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-02-28 10:10:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:38,264 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-02-28 10:10:38,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-28 10:10:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-02-28 10:10:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-28 10:10:38,265 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:38,265 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-28 10:10:38,266 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:38,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:38,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-02-28 10:10:38,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:38,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:38,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:38,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:38,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:38,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:38,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:38,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:38,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:38,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:38,780 INFO L193 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 [2019-02-28 10:10:38,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:38,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:38,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-28 10:10:38,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:38,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-28 10:10:38,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:39,049 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:39,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:39,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-02-28 10:10:39,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:39,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-28 10:10:39,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-28 10:10:39,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:10:39,114 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-02-28 10:10:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:40,610 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-02-28 10:10:40,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-28 10:10:40,611 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-02-28 10:10:40,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:40,612 INFO L225 Difference]: With dead ends: 109 [2019-02-28 10:10:40,612 INFO L226 Difference]: Without dead ends: 83 [2019-02-28 10:10:40,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:10:40,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-28 10:10:40,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-02-28 10:10:40,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-28 10:10:40,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-02-28 10:10:40,621 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-02-28 10:10:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:40,621 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-02-28 10:10:40,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-28 10:10:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-02-28 10:10:40,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-28 10:10:40,622 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:40,622 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-28 10:10:40,622 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:40,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:40,623 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-02-28 10:10:40,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:40,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:40,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:40,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:40,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:40,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:40,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:40,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:40,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:40,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:40,895 INFO L193 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 [2019-02-28 10:10:40,904 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:40,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:40,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:40,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:40,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-28 10:10:40,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:41,067 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:41,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:41,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-02-28 10:10:41,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:41,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-28 10:10:41,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-28 10:10:41,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:10:41,249 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-02-28 10:10:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:41,596 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-02-28 10:10:41,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-28 10:10:41,597 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-02-28 10:10:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:41,598 INFO L225 Difference]: With dead ends: 120 [2019-02-28 10:10:41,598 INFO L226 Difference]: Without dead ends: 61 [2019-02-28 10:10:41,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:10:41,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-28 10:10:41,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-02-28 10:10:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-28 10:10:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-02-28 10:10:41,608 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-02-28 10:10:41,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:41,608 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-02-28 10:10:41,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-28 10:10:41,608 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-02-28 10:10:41,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-28 10:10:41,609 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:41,609 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-28 10:10:41,610 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:41,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:41,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-02-28 10:10:41,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:41,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:41,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:41,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:41,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:42,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:42,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:42,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:42,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:42,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:42,016 INFO L193 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 [2019-02-28 10:10:42,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:42,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:42,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-28 10:10:42,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:42,267 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:42,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:42,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-02-28 10:10:42,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:42,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-28 10:10:42,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-28 10:10:42,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-02-28 10:10:42,367 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-02-28 10:10:43,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:43,835 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-02-28 10:10:43,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-28 10:10:43,836 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-02-28 10:10:43,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:43,837 INFO L225 Difference]: With dead ends: 124 [2019-02-28 10:10:43,837 INFO L226 Difference]: Without dead ends: 94 [2019-02-28 10:10:43,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-02-28 10:10:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-28 10:10:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-02-28 10:10:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-28 10:10:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-02-28 10:10:43,848 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-02-28 10:10:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:43,849 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-02-28 10:10:43,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-28 10:10:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-02-28 10:10:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-28 10:10:43,850 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:43,850 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-28 10:10:43,850 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:43,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:43,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-02-28 10:10:43,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:43,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:43,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:43,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:43,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:44,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:44,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:44,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:44,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:44,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:44,072 INFO L193 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 [2019-02-28 10:10:44,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:44,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:44,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-28 10:10:44,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:44,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-28 10:10:44,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:44,437 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:44,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:44,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-02-28 10:10:44,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:44,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-28 10:10:44,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-28 10:10:44,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-02-28 10:10:44,831 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-02-28 10:10:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:45,356 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-02-28 10:10:45,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-28 10:10:45,356 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-02-28 10:10:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:45,357 INFO L225 Difference]: With dead ends: 135 [2019-02-28 10:10:45,357 INFO L226 Difference]: Without dead ends: 68 [2019-02-28 10:10:45,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:10:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-28 10:10:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-02-28 10:10:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-28 10:10:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-02-28 10:10:45,374 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-02-28 10:10:45,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:45,374 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-02-28 10:10:45,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-28 10:10:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-02-28 10:10:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-28 10:10:45,375 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:45,376 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-28 10:10:45,381 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:45,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:45,381 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-02-28 10:10:45,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:45,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:45,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:45,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:45,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:45,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:45,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:45,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:45,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:45,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:45,785 INFO L193 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 [2019-02-28 10:10:45,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:45,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:45,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:45,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:45,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-28 10:10:45,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:46,127 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:46,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:46,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-02-28 10:10:46,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:46,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-28 10:10:46,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-28 10:10:46,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:10:46,207 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-02-28 10:10:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:47,986 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-02-28 10:10:47,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-28 10:10:47,986 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-02-28 10:10:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:47,987 INFO L225 Difference]: With dead ends: 139 [2019-02-28 10:10:47,987 INFO L226 Difference]: Without dead ends: 105 [2019-02-28 10:10:47,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:10:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-28 10:10:48,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-02-28 10:10:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-28 10:10:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-02-28 10:10:48,002 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-02-28 10:10:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:48,002 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-02-28 10:10:48,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-28 10:10:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-02-28 10:10:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-28 10:10:48,003 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:48,003 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-28 10:10:48,004 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:48,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:48,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-02-28 10:10:48,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:48,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:48,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:48,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:48,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:48,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:48,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:48,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:48,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:48,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:48,305 INFO L193 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 [2019-02-28 10:10:48,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:48,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:48,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-28 10:10:48,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:48,946 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:48,946 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:49,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:49,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-02-28 10:10:49,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:49,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-28 10:10:49,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-28 10:10:49,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:10:49,109 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-02-28 10:10:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:49,646 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-02-28 10:10:49,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-28 10:10:49,647 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-02-28 10:10:49,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:49,647 INFO L225 Difference]: With dead ends: 150 [2019-02-28 10:10:49,647 INFO L226 Difference]: Without dead ends: 75 [2019-02-28 10:10:49,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-02-28 10:10:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-28 10:10:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-02-28 10:10:49,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-28 10:10:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-02-28 10:10:49,656 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-02-28 10:10:49,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:49,656 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-02-28 10:10:49,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-28 10:10:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-02-28 10:10:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-28 10:10:49,657 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:49,657 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-28 10:10:49,657 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:49,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:49,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-02-28 10:10:49,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:49,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:49,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:49,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:49,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:50,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:50,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:50,272 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:50,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:50,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:50,273 INFO L193 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 [2019-02-28 10:10:50,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:50,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:50,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-28 10:10:50,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:50,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-28 10:10:50,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:51,181 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:51,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:51,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-02-28 10:10:51,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:51,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:10:51,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:10:51,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-02-28 10:10:51,936 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-02-28 10:10:54,444 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-02-28 10:10:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:56,571 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-02-28 10:10:56,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-28 10:10:56,572 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-02-28 10:10:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:56,573 INFO L225 Difference]: With dead ends: 192 [2019-02-28 10:10:56,573 INFO L226 Difference]: Without dead ends: 113 [2019-02-28 10:10:56,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-02-28 10:10:56,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-28 10:10:56,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-02-28 10:10:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-28 10:10:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-02-28 10:10:56,585 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-02-28 10:10:56,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:56,586 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-02-28 10:10:56,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:10:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-02-28 10:10:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-28 10:10:56,586 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:56,586 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-02-28 10:10:56,587 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:56,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:56,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-02-28 10:10:56,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:56,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:56,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:56,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:56,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:57,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:57,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:57,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:57,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:57,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:57,741 INFO L193 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 [2019-02-28 10:10:57,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:57,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:57,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:57,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:57,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-28 10:10:57,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:58,331 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:58,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:58,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-02-28 10:10:58,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:58,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-28 10:10:58,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-28 10:10:58,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:10:58,415 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-02-28 10:11:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:00,623 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-02-28 10:11:00,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-28 10:11:00,626 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-02-28 10:11:00,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:00,627 INFO L225 Difference]: With dead ends: 169 [2019-02-28 10:11:00,627 INFO L226 Difference]: Without dead ends: 127 [2019-02-28 10:11:00,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-02-28 10:11:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-28 10:11:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-02-28 10:11:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-28 10:11:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-02-28 10:11:00,638 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-02-28 10:11:00,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:00,638 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-02-28 10:11:00,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-28 10:11:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-02-28 10:11:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-28 10:11:00,639 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:00,639 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-28 10:11:00,640 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:00,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:00,640 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-02-28 10:11:00,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:00,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:00,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:00,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:00,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:00,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:00,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:00,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:00,918 INFO L193 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 [2019-02-28 10:11:00,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:00,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:00,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-28 10:11:00,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:01,218 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:01,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:01,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-02-28 10:11:01,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:01,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-28 10:11:01,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-28 10:11:01,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:11:01,560 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-02-28 10:11:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:02,093 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-02-28 10:11:02,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-28 10:11:02,094 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-02-28 10:11:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:02,095 INFO L225 Difference]: With dead ends: 180 [2019-02-28 10:11:02,095 INFO L226 Difference]: Without dead ends: 89 [2019-02-28 10:11:02,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:11:02,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-28 10:11:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-02-28 10:11:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-28 10:11:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-02-28 10:11:02,107 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-02-28 10:11:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:02,108 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-02-28 10:11:02,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-28 10:11:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-02-28 10:11:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-28 10:11:02,109 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:02,109 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-28 10:11:02,109 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:02,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:02,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-02-28 10:11:02,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:02,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:02,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:02,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:02,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:02,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:02,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:02,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:02,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:02,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:02,702 INFO L193 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 [2019-02-28 10:11:02,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:02,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:02,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-28 10:11:02,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:02,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-28 10:11:02,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:03,857 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:04,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:04,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-02-28 10:11:04,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:04,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-28 10:11:04,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-28 10:11:04,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-02-28 10:11:04,885 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-02-28 10:11:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:11,131 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-02-28 10:11:11,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-28 10:11:11,131 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-02-28 10:11:11,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:11,133 INFO L225 Difference]: With dead ends: 230 [2019-02-28 10:11:11,133 INFO L226 Difference]: Without dead ends: 135 [2019-02-28 10:11:11,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-02-28 10:11:11,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-28 10:11:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-02-28 10:11:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-28 10:11:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-02-28 10:11:11,150 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-02-28 10:11:11,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:11,150 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-02-28 10:11:11,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-28 10:11:11,151 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-02-28 10:11:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-28 10:11:11,151 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:11,151 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-02-28 10:11:11,151 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:11,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:11,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-02-28 10:11:11,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:11,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:11,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:11,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:11,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:12,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:12,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:12,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:12,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:12,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:12,014 INFO L193 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 [2019-02-28 10:11:12,022 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:12,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:12,036 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:12,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:12,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-28 10:11:12,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:12,547 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:12,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:12,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-02-28 10:11:12,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:12,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-28 10:11:12,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-28 10:11:12,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:11:12,636 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-02-28 10:11:15,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:15,826 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-02-28 10:11:15,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-28 10:11:15,826 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-02-28 10:11:15,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:15,828 INFO L225 Difference]: With dead ends: 199 [2019-02-28 10:11:15,828 INFO L226 Difference]: Without dead ends: 149 [2019-02-28 10:11:15,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:11:15,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-28 10:11:15,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-02-28 10:11:15,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-28 10:11:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-02-28 10:11:15,841 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-02-28 10:11:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:15,842 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-02-28 10:11:15,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-28 10:11:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-02-28 10:11:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-28 10:11:15,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:15,843 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-28 10:11:15,843 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:15,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:15,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-02-28 10:11:15,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:15,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:15,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:15,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:15,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:16,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:16,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:16,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:16,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:16,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:16,172 INFO L193 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 [2019-02-28 10:11:16,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:16,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:16,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-28 10:11:16,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:16,574 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:17,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:17,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-02-28 10:11:17,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:17,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-28 10:11:17,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-28 10:11:17,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:11:17,356 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-02-28 10:11:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:17,999 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-02-28 10:11:17,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-28 10:11:17,999 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-02-28 10:11:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:18,000 INFO L225 Difference]: With dead ends: 210 [2019-02-28 10:11:18,000 INFO L226 Difference]: Without dead ends: 103 [2019-02-28 10:11:18,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:11:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-28 10:11:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-02-28 10:11:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-28 10:11:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-02-28 10:11:18,016 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-02-28 10:11:18,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:18,016 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-02-28 10:11:18,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-28 10:11:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-02-28 10:11:18,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-28 10:11:18,017 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:18,017 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-28 10:11:18,017 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:18,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:18,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-02-28 10:11:18,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:18,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:18,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:18,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:18,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:18,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:18,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:18,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:18,742 INFO L193 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 [2019-02-28 10:11:18,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:18,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:18,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-28 10:11:18,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:18,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-28 10:11:18,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:19,389 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:19,389 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:19,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:19,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-02-28 10:11:19,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:19,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:11:19,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:11:19,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-02-28 10:11:19,493 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-02-28 10:11:23,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:23,134 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-02-28 10:11:23,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-28 10:11:23,134 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-02-28 10:11:23,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:23,135 INFO L225 Difference]: With dead ends: 214 [2019-02-28 10:11:23,135 INFO L226 Difference]: Without dead ends: 160 [2019-02-28 10:11:23,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-02-28 10:11:23,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-28 10:11:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-02-28 10:11:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-28 10:11:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-02-28 10:11:23,151 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-02-28 10:11:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:23,151 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-02-28 10:11:23,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:11:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-02-28 10:11:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-28 10:11:23,152 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:23,152 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-28 10:11:23,152 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:23,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-02-28 10:11:23,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:23,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:23,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:23,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:23,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:23,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:23,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:23,642 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:23,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:23,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:23,643 INFO L193 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 [2019-02-28 10:11:23,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:23,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:23,668 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:23,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:23,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-28 10:11:23,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:24,071 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:24,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:24,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-02-28 10:11:24,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:24,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:11:24,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:11:24,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-02-28 10:11:24,359 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-02-28 10:11:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:24,957 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-02-28 10:11:24,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-28 10:11:24,957 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-02-28 10:11:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:24,958 INFO L225 Difference]: With dead ends: 225 [2019-02-28 10:11:24,958 INFO L226 Difference]: Without dead ends: 110 [2019-02-28 10:11:24,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:11:24,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-28 10:11:24,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-02-28 10:11:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-28 10:11:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-02-28 10:11:24,975 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-02-28 10:11:24,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:24,975 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-02-28 10:11:24,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:11:24,975 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-02-28 10:11:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-28 10:11:24,975 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:24,976 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-28 10:11:24,976 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:24,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:24,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-02-28 10:11:24,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:24,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:24,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:24,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:24,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:26,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:26,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:26,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:26,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:26,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:26,140 INFO L193 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 [2019-02-28 10:11:26,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:26,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:26,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-28 10:11:26,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:26,819 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:26,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:26,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-02-28 10:11:26,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:26,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-28 10:11:26,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-28 10:11:26,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:11:26,936 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-02-28 10:11:31,510 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-02-28 10:11:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:31,817 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-02-28 10:11:31,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-28 10:11:31,818 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-02-28 10:11:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:31,819 INFO L225 Difference]: With dead ends: 229 [2019-02-28 10:11:31,819 INFO L226 Difference]: Without dead ends: 171 [2019-02-28 10:11:31,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:11:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-28 10:11:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-02-28 10:11:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-28 10:11:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-02-28 10:11:31,836 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-02-28 10:11:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:31,836 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-02-28 10:11:31,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-28 10:11:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-02-28 10:11:31,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-28 10:11:31,836 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:31,837 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-28 10:11:31,837 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:31,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:31,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-02-28 10:11:31,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:31,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:31,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:31,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:31,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:32,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:32,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:32,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:32,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:32,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:32,250 INFO L193 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 [2019-02-28 10:11:32,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:32,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:32,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-28 10:11:32,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:32,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-28 10:11:32,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:32,787 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:33,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:33,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-02-28 10:11:33,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:33,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-28 10:11:33,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-28 10:11:33,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:11:33,117 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-02-28 10:11:33,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:33,714 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-02-28 10:11:33,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-28 10:11:33,714 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-02-28 10:11:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:33,715 INFO L225 Difference]: With dead ends: 240 [2019-02-28 10:11:33,716 INFO L226 Difference]: Without dead ends: 117 [2019-02-28 10:11:33,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-02-28 10:11:33,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-28 10:11:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-02-28 10:11:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-28 10:11:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-02-28 10:11:33,732 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-02-28 10:11:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:33,732 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-02-28 10:11:33,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-28 10:11:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-02-28 10:11:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-28 10:11:33,733 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:33,733 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-28 10:11:33,733 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:33,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:33,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-02-28 10:11:33,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:33,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:33,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:33,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:33,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:34,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:34,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:34,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:34,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:34,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:34,620 INFO L193 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 [2019-02-28 10:11:34,629 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:34,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:34,650 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:34,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:34,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-28 10:11:34,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:35,377 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:35,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:35,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-02-28 10:11:35,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:35,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-28 10:11:35,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-28 10:11:35,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-02-28 10:11:35,486 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-02-28 10:11:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:40,551 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-02-28 10:11:40,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-28 10:11:40,558 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-02-28 10:11:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:40,559 INFO L225 Difference]: With dead ends: 244 [2019-02-28 10:11:40,559 INFO L226 Difference]: Without dead ends: 182 [2019-02-28 10:11:40,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-02-28 10:11:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-28 10:11:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-02-28 10:11:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-28 10:11:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-02-28 10:11:40,583 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-02-28 10:11:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:40,583 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-02-28 10:11:40,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-28 10:11:40,584 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-02-28 10:11:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-28 10:11:40,584 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:40,584 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-28 10:11:40,585 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:40,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:40,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-02-28 10:11:40,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:40,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:40,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:40,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:40,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:41,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:41,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:41,265 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:41,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:41,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:41,266 INFO L193 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 [2019-02-28 10:11:41,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:41,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:41,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-28 10:11:41,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:41,817 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:42,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:42,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-02-28 10:11:42,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:42,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-28 10:11:42,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-28 10:11:42,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-02-28 10:11:42,213 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-02-28 10:11:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:43,126 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-02-28 10:11:43,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-28 10:11:43,126 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-02-28 10:11:43,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:43,128 INFO L225 Difference]: With dead ends: 255 [2019-02-28 10:11:43,128 INFO L226 Difference]: Without dead ends: 124 [2019-02-28 10:11:43,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:11:43,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-02-28 10:11:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-02-28 10:11:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-28 10:11:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-02-28 10:11:43,151 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-02-28 10:11:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:43,151 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-02-28 10:11:43,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-28 10:11:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-02-28 10:11:43,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-02-28 10:11:43,152 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:43,152 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-28 10:11:43,153 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:43,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:43,153 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-02-28 10:11:43,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:43,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:43,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:43,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:43,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:44,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:44,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:44,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:44,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:44,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:44,206 INFO L193 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 [2019-02-28 10:11:44,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:44,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:44,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-28 10:11:44,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:44,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-28 10:11:44,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:46,463 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:48,262 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:48,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:48,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-02-28 10:11:48,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:48,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-28 10:11:48,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-28 10:11:48,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:11:48,282 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-02-28 10:11:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:58,580 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-02-28 10:11:58,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-02-28 10:11:58,580 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-02-28 10:11:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:58,582 INFO L225 Difference]: With dead ends: 325 [2019-02-28 10:11:58,582 INFO L226 Difference]: Without dead ends: 190 [2019-02-28 10:11:58,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:11:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-02-28 10:11:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-02-28 10:11:58,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-28 10:11:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-02-28 10:11:58,603 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-02-28 10:11:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:58,603 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-02-28 10:11:58,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-28 10:11:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-02-28 10:11:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-28 10:11:58,604 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:58,604 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-02-28 10:11:58,604 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:58,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:58,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-02-28 10:11:58,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:58,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:58,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:58,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:58,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:00,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:00,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:00,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:00,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:00,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:00,325 INFO L193 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 [2019-02-28 10:12:00,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:00,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:00,364 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:00,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:00,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-28 10:12:00,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:01,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:01,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:01,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:01,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-02-28 10:12:01,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:01,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-28 10:12:01,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-28 10:12:01,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-02-28 10:12:01,723 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-02-28 10:12:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:07,284 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-02-28 10:12:07,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-28 10:12:07,285 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-02-28 10:12:07,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:07,286 INFO L225 Difference]: With dead ends: 274 [2019-02-28 10:12:07,287 INFO L226 Difference]: Without dead ends: 204 [2019-02-28 10:12:07,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-02-28 10:12:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-02-28 10:12:07,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-02-28 10:12:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-28 10:12:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-02-28 10:12:07,310 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-02-28 10:12:07,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:07,310 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-02-28 10:12:07,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-28 10:12:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-02-28 10:12:07,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-28 10:12:07,311 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:07,311 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-28 10:12:07,311 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:07,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:07,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-02-28 10:12:07,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:07,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:07,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:07,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:07,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:07,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:07,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:07,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:07,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:07,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:07,911 INFO L193 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 [2019-02-28 10:12:07,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:07,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:07,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-28 10:12:07,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:08,581 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:09,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:09,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-02-28 10:12:09,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:09,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-28 10:12:09,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-28 10:12:09,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-02-28 10:12:09,066 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-02-28 10:12:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:09,956 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-02-28 10:12:09,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-28 10:12:09,956 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-02-28 10:12:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:09,957 INFO L225 Difference]: With dead ends: 285 [2019-02-28 10:12:09,957 INFO L226 Difference]: Without dead ends: 138 [2019-02-28 10:12:09,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:12:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-28 10:12:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-02-28 10:12:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-28 10:12:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-02-28 10:12:09,983 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-02-28 10:12:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:09,983 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-02-28 10:12:09,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-28 10:12:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-02-28 10:12:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-28 10:12:09,984 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:09,984 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-28 10:12:09,985 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:09,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:09,985 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-02-28 10:12:09,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:09,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:09,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:09,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:09,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:11,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:11,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:11,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:11,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:11,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:11,177 INFO L193 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 [2019-02-28 10:12:11,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:11,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:11,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-28 10:12:11,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:11,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-28 10:12:11,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:13,908 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:16,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:16,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-02-28 10:12:16,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:16,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-28 10:12:16,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-28 10:12:16,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:12:16,134 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-02-28 10:12:27,110 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-28 10:12:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:29,906 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-02-28 10:12:29,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-02-28 10:12:29,907 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-02-28 10:12:29,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:29,908 INFO L225 Difference]: With dead ends: 363 [2019-02-28 10:12:29,908 INFO L226 Difference]: Without dead ends: 212 [2019-02-28 10:12:29,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-02-28 10:12:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-28 10:12:29,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-02-28 10:12:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-28 10:12:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-02-28 10:12:29,935 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-02-28 10:12:29,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:29,935 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-02-28 10:12:29,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-28 10:12:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-02-28 10:12:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-28 10:12:29,936 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:29,936 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-02-28 10:12:29,936 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:29,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:29,936 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-02-28 10:12:29,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:29,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:29,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:29,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:29,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:31,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:31,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:31,172 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:31,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:31,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:31,172 INFO L193 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 [2019-02-28 10:12:31,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:31,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:31,225 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:31,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:31,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-28 10:12:31,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:32,447 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:32,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:32,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-02-28 10:12:32,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:32,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-28 10:12:32,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-28 10:12:32,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-02-28 10:12:32,582 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-02-28 10:12:36,810 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-28 10:12:37,154 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-28 10:12:37,480 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-28 10:12:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:39,306 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-02-28 10:12:39,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-28 10:12:39,306 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-02-28 10:12:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:39,308 INFO L225 Difference]: With dead ends: 304 [2019-02-28 10:12:39,308 INFO L226 Difference]: Without dead ends: 226 [2019-02-28 10:12:39,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-02-28 10:12:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-02-28 10:12:39,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-02-28 10:12:39,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-28 10:12:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-02-28 10:12:39,332 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-02-28 10:12:39,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:39,332 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-02-28 10:12:39,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-28 10:12:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-02-28 10:12:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-28 10:12:39,333 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:39,334 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-28 10:12:39,334 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:39,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:39,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-02-28 10:12:39,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:39,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:39,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:39,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:39,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:40,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:40,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:40,151 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:40,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:40,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:40,152 INFO L193 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 [2019-02-28 10:12:40,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:40,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:40,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-28 10:12:40,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:41,002 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:41,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:41,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-02-28 10:12:41,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:41,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-28 10:12:41,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-28 10:12:41,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-02-28 10:12:41,575 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-02-28 10:12:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:43,116 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-02-28 10:12:43,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-28 10:12:43,117 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-02-28 10:12:43,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:43,118 INFO L225 Difference]: With dead ends: 315 [2019-02-28 10:12:43,118 INFO L226 Difference]: Without dead ends: 152 [2019-02-28 10:12:43,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:12:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-28 10:12:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-02-28 10:12:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-02-28 10:12:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-02-28 10:12:43,151 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-02-28 10:12:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:43,151 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-02-28 10:12:43,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-28 10:12:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-02-28 10:12:43,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-02-28 10:12:43,152 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:43,152 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-28 10:12:43,152 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:43,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:43,153 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-02-28 10:12:43,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:43,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:43,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:43,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:43,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:44,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:44,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:44,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:44,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:44,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:44,725 INFO L193 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 [2019-02-28 10:12:44,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:44,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:44,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-28 10:12:44,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:44,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-28 10:12:44,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:47,838 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:50,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:50,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-02-28 10:12:50,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:50,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-28 10:12:50,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-28 10:12:50,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-02-28 10:12:50,399 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-02-28 10:13:02,223 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-28 10:13:02,536 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-28 10:13:02,939 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-28 10:13:03,215 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:13:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:05,851 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-02-28 10:13:05,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-02-28 10:13:05,851 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-02-28 10:13:05,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:05,853 INFO L225 Difference]: With dead ends: 401 [2019-02-28 10:13:05,853 INFO L226 Difference]: Without dead ends: 234 [2019-02-28 10:13:05,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-02-28 10:13:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-28 10:13:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-02-28 10:13:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-28 10:13:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-02-28 10:13:05,892 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-02-28 10:13:05,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:05,892 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-02-28 10:13:05,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-28 10:13:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-02-28 10:13:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-28 10:13:05,893 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:05,893 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-02-28 10:13:05,894 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:05,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:05,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-02-28 10:13:05,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:05,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:05,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:05,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:05,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:07,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:07,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:07,907 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:07,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:07,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:07,907 INFO L193 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 [2019-02-28 10:13:07,915 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:13:07,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:13:07,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:13:07,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:07,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-28 10:13:07,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:10,184 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:10,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:10,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-02-28 10:13:10,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:10,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-28 10:13:10,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-28 10:13:10,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-02-28 10:13:10,329 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-02-28 10:13:16,179 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-28 10:13:16,502 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-28 10:13:16,801 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-28 10:13:17,000 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:13:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:19,239 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-02-28 10:13:19,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-28 10:13:19,239 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-02-28 10:13:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:19,241 INFO L225 Difference]: With dead ends: 334 [2019-02-28 10:13:19,241 INFO L226 Difference]: Without dead ends: 248 [2019-02-28 10:13:19,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-02-28 10:13:19,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-28 10:13:19,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-02-28 10:13:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-28 10:13:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-02-28 10:13:19,283 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-02-28 10:13:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:19,283 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-02-28 10:13:19,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-28 10:13:19,283 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-02-28 10:13:19,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-28 10:13:19,284 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:19,284 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-28 10:13:19,285 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:19,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:19,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-02-28 10:13:19,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:19,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:19,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:19,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:19,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:20,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:20,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:20,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:20,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:20,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:20,156 INFO L193 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 [2019-02-28 10:13:20,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:20,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:20,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-28 10:13:20,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:21,340 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:21,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:21,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-02-28 10:13:21,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:21,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-28 10:13:21,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-28 10:13:21,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-02-28 10:13:21,988 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-02-28 10:13:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:23,730 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-02-28 10:13:23,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-28 10:13:23,733 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-02-28 10:13:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:23,734 INFO L225 Difference]: With dead ends: 345 [2019-02-28 10:13:23,734 INFO L226 Difference]: Without dead ends: 166 [2019-02-28 10:13:23,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:13:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-02-28 10:13:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-02-28 10:13:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-02-28 10:13:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-02-28 10:13:23,774 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-02-28 10:13:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:23,774 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-02-28 10:13:23,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-28 10:13:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-02-28 10:13:23,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-02-28 10:13:23,775 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:23,776 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-28 10:13:23,776 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:23,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:23,776 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-02-28 10:13:23,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:23,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:23,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:25,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:25,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:25,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:25,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:25,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:25,516 INFO L193 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 [2019-02-28 10:13:25,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:25,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:25,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-28 10:13:25,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:25,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-28 10:13:25,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:26,958 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:27,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:27,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-02-28 10:13:27,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:27,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-28 10:13:27,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-28 10:13:27,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:13:27,117 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-02-28 10:13:34,212 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-28 10:13:34,529 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-28 10:13:34,829 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-28 10:13:35,046 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:13:35,251 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:13:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:37,469 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-02-28 10:13:37,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-28 10:13:37,470 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-02-28 10:13:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:37,472 INFO L225 Difference]: With dead ends: 349 [2019-02-28 10:13:37,472 INFO L226 Difference]: Without dead ends: 259 [2019-02-28 10:13:37,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-02-28 10:13:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-02-28 10:13:37,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-02-28 10:13:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-02-28 10:13:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-02-28 10:13:37,503 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-02-28 10:13:37,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:37,503 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-02-28 10:13:37,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-28 10:13:37,503 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-02-28 10:13:37,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-02-28 10:13:37,504 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:37,504 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-28 10:13:37,504 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:37,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:37,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-02-28 10:13:37,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:37,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:37,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:37,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:37,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:38,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:38,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:38,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:38,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:38,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:38,745 INFO L193 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 [2019-02-28 10:13:38,753 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:13:38,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:13:38,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:13:38,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:38,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-28 10:13:38,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:39,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:40,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:40,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-02-28 10:13:40,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:40,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-28 10:13:40,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-28 10:13:40,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:13:40,500 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-02-28 10:13:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:42,255 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-02-28 10:13:42,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-28 10:13:42,256 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-02-28 10:13:42,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:42,257 INFO L225 Difference]: With dead ends: 360 [2019-02-28 10:13:42,258 INFO L226 Difference]: Without dead ends: 173 [2019-02-28 10:13:42,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:13:42,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-28 10:13:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-02-28 10:13:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-28 10:13:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-02-28 10:13:42,289 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-02-28 10:13:42,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:42,290 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-02-28 10:13:42,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-28 10:13:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-02-28 10:13:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-28 10:13:42,290 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:42,290 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-28 10:13:42,291 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:42,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-02-28 10:13:42,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:42,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:42,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:42,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:42,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:44,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:44,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:44,067 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:44,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:44,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:44,067 INFO L193 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 [2019-02-28 10:13:44,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:44,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:44,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 99 conjunts are in the unsatisfiable core [2019-02-28 10:13:44,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:45,814 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:45,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:45,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-02-28 10:13:45,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:45,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-28 10:13:45,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-28 10:13:45,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-02-28 10:13:45,981 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-02-28 10:13:53,256 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-28 10:13:53,616 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-28 10:13:54,031 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-28 10:13:54,270 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:13:54,492 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:13:54,701 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:13:54,902 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:13:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:57,031 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-02-28 10:13:57,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-28 10:13:57,031 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-02-28 10:13:57,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:57,033 INFO L225 Difference]: With dead ends: 364 [2019-02-28 10:13:57,033 INFO L226 Difference]: Without dead ends: 270 [2019-02-28 10:13:57,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-02-28 10:13:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-02-28 10:13:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-02-28 10:13:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-28 10:13:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-02-28 10:13:57,075 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-02-28 10:13:57,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:57,075 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-02-28 10:13:57,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-28 10:13:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-02-28 10:13:57,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-28 10:13:57,076 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:57,076 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-28 10:13:57,076 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:57,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:57,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-02-28 10:13:57,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:57,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:57,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:57,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:58,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:58,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:58,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:58,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:58,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:58,756 INFO L193 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 [2019-02-28 10:13:58,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:58,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:58,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-28 10:13:58,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:58,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-28 10:13:58,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:00,287 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:01,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:01,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-02-28 10:14:01,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:01,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-28 10:14:01,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-28 10:14:01,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-02-28 10:14:01,088 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-02-28 10:14:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:02,948 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-02-28 10:14:02,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-28 10:14:02,949 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-02-28 10:14:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:02,950 INFO L225 Difference]: With dead ends: 375 [2019-02-28 10:14:02,950 INFO L226 Difference]: Without dead ends: 180 [2019-02-28 10:14:02,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:14:02,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-02-28 10:14:02,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-02-28 10:14:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-28 10:14:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-02-28 10:14:02,981 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-02-28 10:14:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:02,981 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-02-28 10:14:02,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-28 10:14:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-02-28 10:14:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-02-28 10:14:02,981 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:02,982 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-28 10:14:02,982 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:02,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:02,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-02-28 10:14:02,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:02,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:02,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:02,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:02,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:05,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:05,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:05,562 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:05,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:05,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:05,562 INFO L193 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 [2019-02-28 10:14:05,570 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:14:05,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:14:05,598 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:14:05,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:05,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-28 10:14:05,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:07,200 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:07,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:07,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-02-28 10:14:07,381 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:07,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-28 10:14:07,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-28 10:14:07,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:14:07,382 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-02-28 10:14:13,632 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-28 10:14:13,988 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-28 10:14:14,382 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-28 10:14:14,648 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:14:14,880 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:14:15,099 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:14:15,313 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:14:15,522 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:14:17,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:17,729 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-02-28 10:14:17,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-28 10:14:17,730 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-02-28 10:14:17,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:17,732 INFO L225 Difference]: With dead ends: 379 [2019-02-28 10:14:17,732 INFO L226 Difference]: Without dead ends: 281 [2019-02-28 10:14:17,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:14:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-02-28 10:14:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-02-28 10:14:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-02-28 10:14:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-02-28 10:14:17,775 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-02-28 10:14:17,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:17,775 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-02-28 10:14:17,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-28 10:14:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-02-28 10:14:17,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-02-28 10:14:17,777 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:17,777 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-28 10:14:17,777 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:17,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:17,777 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-02-28 10:14:17,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:17,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:17,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:17,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:17,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:18,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:18,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:18,788 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:18,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:18,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:18,788 INFO L193 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 [2019-02-28 10:14:18,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:18,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:14:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:18,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-28 10:14:18,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:20,212 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:21,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:21,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-02-28 10:14:21,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:21,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-28 10:14:21,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-28 10:14:21,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:14:21,063 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-02-28 10:14:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:23,021 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-02-28 10:14:23,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-28 10:14:23,021 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-02-28 10:14:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:23,022 INFO L225 Difference]: With dead ends: 390 [2019-02-28 10:14:23,022 INFO L226 Difference]: Without dead ends: 187 [2019-02-28 10:14:23,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:14:23,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-28 10:14:23,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-02-28 10:14:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-28 10:14:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-02-28 10:14:23,073 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-02-28 10:14:23,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:23,073 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-02-28 10:14:23,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-28 10:14:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-02-28 10:14:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-28 10:14:23,074 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:23,074 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-28 10:14:23,074 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:23,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-02-28 10:14:23,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:23,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:23,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:23,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:23,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:25,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:25,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:25,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:25,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:25,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:25,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:25,611 INFO L193 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 [2019-02-28 10:14:25,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:14:25,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:14:25,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-28 10:14:25,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:25,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-28 10:14:25,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:30,027 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:34,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:34,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:34,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-02-28 10:14:34,052 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:34,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-28 10:14:34,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-28 10:14:34,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-02-28 10:14:34,053 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-02-28 10:14:51,821 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-28 10:14:52,254 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-28 10:14:52,725 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-28 10:14:53,115 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:14:53,499 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:14:53,858 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:14:54,203 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:14:54,533 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:14:54,840 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:14:55,524 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-28 10:14:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:58,094 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-02-28 10:14:58,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-02-28 10:14:58,095 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-02-28 10:14:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:58,096 INFO L225 Difference]: With dead ends: 496 [2019-02-28 10:14:58,096 INFO L226 Difference]: Without dead ends: 289 [2019-02-28 10:14:58,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-02-28 10:14:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-02-28 10:14:58,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-02-28 10:14:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-02-28 10:14:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-02-28 10:14:58,134 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-02-28 10:14:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:58,134 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-02-28 10:14:58,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-28 10:14:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-02-28 10:14:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-02-28 10:14:58,135 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:58,135 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-02-28 10:14:58,135 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:58,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:58,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-02-28 10:14:58,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:58,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:58,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:58,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:58,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:00,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:00,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:00,174 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:00,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:00,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:00,175 INFO L193 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 [2019-02-28 10:15:00,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:15:00,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:15:00,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:15:00,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:00,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 111 conjunts are in the unsatisfiable core [2019-02-28 10:15:00,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:02,341 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:02,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:02,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-02-28 10:15:02,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:02,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-28 10:15:02,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-28 10:15:02,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:15:02,755 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-02-28 10:15:11,152 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-28 10:15:11,561 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-28 10:15:11,963 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-28 10:15:12,239 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:15:12,502 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:15:12,744 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:15:12,983 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:15:13,212 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:15:13,443 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:15:13,672 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:15:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:16,184 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-02-28 10:15:16,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-28 10:15:16,185 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-02-28 10:15:16,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:16,186 INFO L225 Difference]: With dead ends: 409 [2019-02-28 10:15:16,186 INFO L226 Difference]: Without dead ends: 303 [2019-02-28 10:15:16,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:15:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-02-28 10:15:16,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-02-28 10:15:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-02-28 10:15:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-02-28 10:15:16,225 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-02-28 10:15:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:16,225 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-02-28 10:15:16,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-28 10:15:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-02-28 10:15:16,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-02-28 10:15:16,226 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:16,227 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-28 10:15:16,227 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:16,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:16,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-02-28 10:15:16,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:16,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:16,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:16,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:16,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:17,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:17,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:17,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:17,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:17,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:17,322 INFO L193 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 [2019-02-28 10:15:17,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:17,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:15:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:17,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-28 10:15:17,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:20,686 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:21,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:21,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-02-28 10:15:21,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:21,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-28 10:15:21,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-28 10:15:21,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:15:21,951 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-02-28 10:15:24,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:24,220 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-02-28 10:15:24,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-28 10:15:24,220 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-02-28 10:15:24,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:24,222 INFO L225 Difference]: With dead ends: 420 [2019-02-28 10:15:24,222 INFO L226 Difference]: Without dead ends: 201 [2019-02-28 10:15:24,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-02-28 10:15:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-28 10:15:24,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-02-28 10:15:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-28 10:15:24,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-02-28 10:15:24,259 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-02-28 10:15:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:24,259 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-02-28 10:15:24,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-28 10:15:24,259 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-02-28 10:15:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-28 10:15:24,259 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:24,260 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-28 10:15:24,260 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:24,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:24,260 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-02-28 10:15:24,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:24,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:24,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:24,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:24,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:26,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:26,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:26,397 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:26,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:26,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:26,397 INFO L193 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 [2019-02-28 10:15:26,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:15:26,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:15:26,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-28 10:15:26,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:26,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 115 conjunts are in the unsatisfiable core [2019-02-28 10:15:26,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:28,416 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:28,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:28,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-02-28 10:15:28,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:28,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-28 10:15:28,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-28 10:15:28,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-02-28 10:15:28,624 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-02-28 10:15:37,230 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-28 10:15:37,655 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-28 10:15:38,064 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-28 10:15:38,353 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:15:38,639 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:15:38,908 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:15:39,172 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:15:39,428 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:15:39,670 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:15:39,912 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:15:40,135 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:15:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:42,693 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-02-28 10:15:42,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-02-28 10:15:42,693 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-02-28 10:15:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:42,695 INFO L225 Difference]: With dead ends: 424 [2019-02-28 10:15:42,696 INFO L226 Difference]: Without dead ends: 314 [2019-02-28 10:15:42,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-02-28 10:15:42,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-28 10:15:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-02-28 10:15:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-28 10:15:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-02-28 10:15:42,747 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-02-28 10:15:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:42,747 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-02-28 10:15:42,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-28 10:15:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-02-28 10:15:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-28 10:15:42,749 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:42,749 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-28 10:15:42,749 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:42,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:42,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-02-28 10:15:42,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:42,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:42,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:42,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:42,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:43,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:43,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:43,897 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:43,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:43,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:43,897 INFO L193 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 [2019-02-28 10:15:43,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:15:43,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:15:43,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:15:43,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:43,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 60 conjunts are in the unsatisfiable core [2019-02-28 10:15:43,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:45,473 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:46,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:46,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-02-28 10:15:46,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:46,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-28 10:15:46,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-28 10:15:46,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-02-28 10:15:46,747 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-02-28 10:15:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:49,058 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-02-28 10:15:49,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-28 10:15:49,058 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-02-28 10:15:49,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:49,060 INFO L225 Difference]: With dead ends: 435 [2019-02-28 10:15:49,060 INFO L226 Difference]: Without dead ends: 208 [2019-02-28 10:15:49,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:15:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-02-28 10:15:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-02-28 10:15:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-02-28 10:15:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-02-28 10:15:49,109 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-02-28 10:15:49,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:49,109 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-02-28 10:15:49,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-28 10:15:49,109 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-02-28 10:15:49,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-02-28 10:15:49,110 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:49,111 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-28 10:15:49,111 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:49,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:49,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-02-28 10:15:49,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:49,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:49,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:49,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:49,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:51,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:51,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:51,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:51,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:51,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:51,077 INFO L193 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 [2019-02-28 10:15:51,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:51,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:15:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:51,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 119 conjunts are in the unsatisfiable core [2019-02-28 10:15:51,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:53,513 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:53,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:53,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-02-28 10:15:53,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:53,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-28 10:15:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-28 10:15:53,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:15:53,726 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-02-28 10:16:02,843 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-28 10:16:03,292 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-28 10:16:03,719 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-28 10:16:04,024 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:16:04,313 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:16:04,594 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:16:04,872 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:16:05,136 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:16:05,391 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:16:05,643 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:16:05,881 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:16:06,124 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:16:06,962 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-28 10:16:07,230 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-02-28 10:16:08,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:08,691 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-02-28 10:16:08,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-02-28 10:16:08,692 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-02-28 10:16:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:08,693 INFO L225 Difference]: With dead ends: 439 [2019-02-28 10:16:08,693 INFO L226 Difference]: Without dead ends: 325 [2019-02-28 10:16:08,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:16:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-02-28 10:16:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-02-28 10:16:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-02-28 10:16:08,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-02-28 10:16:08,739 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-02-28 10:16:08,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:08,739 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-02-28 10:16:08,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-28 10:16:08,740 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-02-28 10:16:08,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-02-28 10:16:08,741 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:08,741 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-28 10:16:08,741 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:08,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:08,742 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-02-28 10:16:08,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:08,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:08,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:08,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:08,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:09,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:09,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:09,946 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:09,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:09,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:09,946 INFO L193 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 [2019-02-28 10:16:09,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:16:09,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:16:10,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-28 10:16:10,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:10,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-28 10:16:10,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:11,542 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:13,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:13,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-02-28 10:16:13,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:13,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-28 10:16:13,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-28 10:16:13,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:16:13,024 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-02-28 10:16:15,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:15,646 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-02-28 10:16:15,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-28 10:16:15,647 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-02-28 10:16:15,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:15,648 INFO L225 Difference]: With dead ends: 450 [2019-02-28 10:16:15,649 INFO L226 Difference]: Without dead ends: 215 [2019-02-28 10:16:15,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:16:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-28 10:16:15,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-02-28 10:16:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-28 10:16:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-02-28 10:16:15,715 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-02-28 10:16:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:15,716 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-02-28 10:16:15,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-28 10:16:15,716 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-02-28 10:16:15,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-28 10:16:15,717 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:15,717 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-28 10:16:15,717 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:15,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:15,718 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-02-28 10:16:15,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:15,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:15,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:15,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:15,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:18,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:18,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:18,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:18,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:18,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:18,045 INFO L193 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 [2019-02-28 10:16:18,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:16:18,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:16:18,098 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:16:18,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:18,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 123 conjunts are in the unsatisfiable core [2019-02-28 10:16:18,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:20,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:20,940 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:21,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:21,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-02-28 10:16:21,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:21,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-28 10:16:21,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-28 10:16:21,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-02-28 10:16:21,206 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-02-28 10:16:31,556 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-28 10:16:31,995 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-28 10:16:32,434 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-28 10:16:32,826 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:16:33,123 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:16:33,413 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:16:33,711 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:16:34,002 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:16:34,273 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:16:34,533 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:16:34,777 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:16:35,018 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:16:35,250 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:16:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:37,980 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-02-28 10:16:37,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-02-28 10:16:37,981 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-02-28 10:16:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:37,982 INFO L225 Difference]: With dead ends: 454 [2019-02-28 10:16:37,982 INFO L226 Difference]: Without dead ends: 336 [2019-02-28 10:16:37,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-02-28 10:16:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-02-28 10:16:38,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-02-28 10:16:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-28 10:16:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-02-28 10:16:38,036 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-02-28 10:16:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:38,036 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-02-28 10:16:38,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-28 10:16:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-02-28 10:16:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-28 10:16:38,037 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:38,037 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-28 10:16:38,038 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:38,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:38,038 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-02-28 10:16:38,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:38,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:38,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:38,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:38,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:39,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:39,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:39,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:39,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:39,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:39,405 INFO L193 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 [2019-02-28 10:16:39,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:39,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:16:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:39,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-28 10:16:39,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:40,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:42,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:42,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-02-28 10:16:42,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:42,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-28 10:16:42,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-28 10:16:42,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-02-28 10:16:42,093 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-02-28 10:16:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:45,152 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-02-28 10:16:45,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-28 10:16:45,152 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-02-28 10:16:45,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:45,153 INFO L225 Difference]: With dead ends: 465 [2019-02-28 10:16:45,153 INFO L226 Difference]: Without dead ends: 222 [2019-02-28 10:16:45,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:16:45,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-02-28 10:16:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-02-28 10:16:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-02-28 10:16:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-02-28 10:16:45,197 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-02-28 10:16:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:45,197 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-02-28 10:16:45,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-28 10:16:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-02-28 10:16:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-02-28 10:16:45,198 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:45,198 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-28 10:16:45,198 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:45,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:45,198 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-02-28 10:16:45,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:45,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:45,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:45,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:45,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:47,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:47,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:47,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:47,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:47,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:47,440 INFO L193 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 [2019-02-28 10:16:47,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:16:47,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:16:47,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-28 10:16:47,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:47,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-28 10:16:47,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:53,782 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:59,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:59,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-02-28 10:16:59,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:59,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-28 10:16:59,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-28 10:16:59,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:16:59,395 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-02-28 10:17:23,565 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-28 10:17:24,181 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-28 10:17:24,769 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-28 10:17:25,257 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:17:25,746 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:17:26,212 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:17:26,657 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:17:27,094 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:17:27,526 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:17:27,963 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:17:28,364 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:17:28,746 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:17:29,180 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:17:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:33,151 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-02-28 10:17:33,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-02-28 10:17:33,152 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-02-28 10:17:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:33,154 INFO L225 Difference]: With dead ends: 591 [2019-02-28 10:17:33,154 INFO L226 Difference]: Without dead ends: 344 [2019-02-28 10:17:33,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-02-28 10:17:33,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-02-28 10:17:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-02-28 10:17:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-02-28 10:17:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-02-28 10:17:33,204 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-02-28 10:17:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:33,205 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-02-28 10:17:33,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-28 10:17:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-02-28 10:17:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-02-28 10:17:33,205 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:33,206 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-02-28 10:17:33,206 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:33,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:33,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-02-28 10:17:33,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:33,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:33,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:33,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:33,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:35,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:35,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:35,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:35,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:35,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:35,813 INFO L193 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 [2019-02-28 10:17:35,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:17:35,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:17:35,859 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:17:35,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:35,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 131 conjunts are in the unsatisfiable core [2019-02-28 10:17:35,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:38,328 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:38,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:38,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-02-28 10:17:38,616 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:38,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-28 10:17:38,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-28 10:17:38,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-02-28 10:17:38,617 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-02-28 10:17:51,552 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-28 10:17:52,045 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-28 10:17:52,537 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-28 10:17:52,879 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-28 10:17:53,211 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:17:53,534 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:17:53,849 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:17:54,151 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:17:54,501 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:17:54,840 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:17:55,125 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:17:55,423 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:17:55,687 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:17:55,938 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:17:56,185 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:17:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:58,796 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-02-28 10:17:58,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-02-28 10:17:58,796 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-02-28 10:17:58,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:58,798 INFO L225 Difference]: With dead ends: 484 [2019-02-28 10:17:58,798 INFO L226 Difference]: Without dead ends: 358 [2019-02-28 10:17:58,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-02-28 10:17:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-02-28 10:17:58,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-02-28 10:17:58,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-02-28 10:17:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-02-28 10:17:58,850 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-02-28 10:17:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:58,850 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-02-28 10:17:58,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-28 10:17:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-02-28 10:17:58,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-02-28 10:17:58,851 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:58,851 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-28 10:17:58,852 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:58,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:58,852 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-02-28 10:17:58,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:58,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:58,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:00,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:00,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:00,617 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:00,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:00,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:00,617 INFO L193 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 [2019-02-28 10:18:00,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:00,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:18:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:00,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-28 10:18:00,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:02,391 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:03,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:03,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-02-28 10:18:03,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:03,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-28 10:18:03,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-28 10:18:03,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-02-28 10:18:03,925 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-02-28 10:18:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:06,451 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-02-28 10:18:06,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-28 10:18:06,451 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-02-28 10:18:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:06,453 INFO L225 Difference]: With dead ends: 495 [2019-02-28 10:18:06,453 INFO L226 Difference]: Without dead ends: 236 [2019-02-28 10:18:06,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:18:06,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-02-28 10:18:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-02-28 10:18:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-02-28 10:18:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-02-28 10:18:06,508 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-02-28 10:18:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:06,508 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-02-28 10:18:06,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-28 10:18:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-02-28 10:18:06,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-02-28 10:18:06,509 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:06,509 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-28 10:18:06,509 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:06,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:06,510 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-02-28 10:18:06,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:06,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:06,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:06,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:06,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:09,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:09,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:09,026 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:09,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:09,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:09,026 INFO L193 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 [2019-02-28 10:18:09,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:18:09,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:18:09,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-28 10:18:09,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:18:09,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-28 10:18:09,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:16,073 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:22,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:22,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-02-28 10:18:22,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:22,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-02-28 10:18:22,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-02-28 10:18:22,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:18:22,292 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-02-28 10:18:47,752 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-28 10:18:48,349 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-28 10:18:48,967 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-28 10:18:49,514 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-28 10:18:50,078 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-28 10:18:50,616 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:18:51,162 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:18:51,647 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:18:52,132 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:18:52,669 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:18:53,125 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:18:53,556 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:18:53,975 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:18:54,374 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:18:54,761 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:18:55,123 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:18:59,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:59,042 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-02-28 10:18:59,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-02-28 10:18:59,043 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-02-28 10:18:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:59,045 INFO L225 Difference]: With dead ends: 629 [2019-02-28 10:18:59,045 INFO L226 Difference]: Without dead ends: 366 [2019-02-28 10:18:59,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-02-28 10:18:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-28 10:18:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-02-28 10:18:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-28 10:18:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-02-28 10:18:59,103 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-02-28 10:18:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:59,103 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-02-28 10:18:59,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-02-28 10:18:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-02-28 10:18:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-28 10:18:59,104 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:59,104 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-02-28 10:18:59,104 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:59,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:59,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-02-28 10:18:59,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:59,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:59,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:59,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:59,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:01,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:01,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:01,983 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:01,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:01,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:01,983 INFO L193 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 [2019-02-28 10:19:01,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:19:01,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:19:02,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:19:02,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:02,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 139 conjunts are in the unsatisfiable core [2019-02-28 10:19:02,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:04,885 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:05,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:05,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-02-28 10:19:05,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:05,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-28 10:19:05,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-28 10:19:05,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-02-28 10:19:05,142 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-02-28 10:19:17,127 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-28 10:19:17,662 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-28 10:19:18,198 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-28 10:19:18,572 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-28 10:19:18,933 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-28 10:19:19,288 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-28 10:19:19,639 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:19:19,978 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:19:20,336 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:19:20,658 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:19:20,981 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:19:21,292 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:19:21,665 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:19:21,972 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:19:22,250 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:19:22,521 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:19:22,784 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:19:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:25,603 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-02-28 10:19:25,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-02-28 10:19:25,604 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-02-28 10:19:25,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:25,606 INFO L225 Difference]: With dead ends: 514 [2019-02-28 10:19:25,606 INFO L226 Difference]: Without dead ends: 380 [2019-02-28 10:19:25,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-02-28 10:19:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-02-28 10:19:25,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-02-28 10:19:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-02-28 10:19:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-02-28 10:19:25,664 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-02-28 10:19:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:25,664 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-02-28 10:19:25,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-28 10:19:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-02-28 10:19:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-02-28 10:19:25,665 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:25,665 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-28 10:19:25,665 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:25,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:25,665 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-02-28 10:19:25,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:25,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:25,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:19:25,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:25,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:27,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:27,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:27,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:27,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:27,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:27,456 INFO L193 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 [2019-02-28 10:19:27,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:19:27,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:19:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:27,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-28 10:19:27,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:29,416 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:30,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:30,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-02-28 10:19:30,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:30,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-28 10:19:30,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-28 10:19:30,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-02-28 10:19:30,882 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-02-28 10:19:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:33,654 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-02-28 10:19:33,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-28 10:19:33,655 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-02-28 10:19:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:33,656 INFO L225 Difference]: With dead ends: 525 [2019-02-28 10:19:33,656 INFO L226 Difference]: Without dead ends: 250 [2019-02-28 10:19:33,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:19:33,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-28 10:19:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-02-28 10:19:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-28 10:19:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-02-28 10:19:33,718 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-02-28 10:19:33,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:33,718 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-02-28 10:19:33,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-28 10:19:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-02-28 10:19:33,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-02-28 10:19:33,719 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:33,720 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-28 10:19:33,720 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:33,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:33,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-02-28 10:19:33,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:33,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:19:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:33,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:36,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:36,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:36,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:36,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:36,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:36,492 INFO L193 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 [2019-02-28 10:19:36,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:19:36,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:19:36,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-28 10:19:36,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:36,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-28 10:19:36,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:44,279 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:51,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:51,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-02-28 10:19:51,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:51,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-02-28 10:19:51,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-02-28 10:19:51,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:19:51,139 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-02-28 10:20:18,980 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-28 10:20:19,631 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-28 10:20:20,278 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-28 10:20:20,887 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-28 10:20:21,488 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-28 10:20:22,052 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-28 10:20:22,615 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-28 10:20:23,250 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:20:23,823 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:20:24,348 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:20:24,859 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:20:25,360 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:20:25,838 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:20:26,301 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:20:26,759 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:20:27,172 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:20:27,573 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:20:27,960 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:20:28,410 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-28 10:20:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:31,990 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-02-28 10:20:31,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-02-28 10:20:31,990 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-02-28 10:20:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:31,993 INFO L225 Difference]: With dead ends: 667 [2019-02-28 10:20:31,993 INFO L226 Difference]: Without dead ends: 388 [2019-02-28 10:20:31,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 48.9s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-02-28 10:20:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-02-28 10:20:32,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-02-28 10:20:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-02-28 10:20:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-02-28 10:20:32,062 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-02-28 10:20:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:32,062 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-02-28 10:20:32,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-02-28 10:20:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-02-28 10:20:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-02-28 10:20:32,063 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:32,064 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-02-28 10:20:32,064 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:32,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:32,064 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-02-28 10:20:32,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:32,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:32,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:20:32,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:32,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:35,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:35,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:35,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:35,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:35,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:35,296 INFO L193 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 [2019-02-28 10:20:35,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:20:35,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:20:35,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:20:35,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:20:35,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 147 conjunts are in the unsatisfiable core [2019-02-28 10:20:35,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:38,589 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:38,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:38,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-02-28 10:20:38,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:38,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-28 10:20:38,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-28 10:20:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-02-28 10:20:38,892 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-02-28 10:20:52,744 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-28 10:20:53,324 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-28 10:20:53,967 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-28 10:20:54,376 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-28 10:20:54,778 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-28 10:20:55,169 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-28 10:20:55,560 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-28 10:20:55,937 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-28 10:20:56,304 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:20:56,660 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:20:57,018 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:20:57,351 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:20:57,671 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:20:57,994 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:20:58,312 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:20:58,610 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:20:58,962 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:20:59,251 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:21:02,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:02,423 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-02-28 10:21:02,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-02-28 10:21:02,423 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-02-28 10:21:02,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:02,425 INFO L225 Difference]: With dead ends: 544 [2019-02-28 10:21:02,425 INFO L226 Difference]: Without dead ends: 402 [2019-02-28 10:21:02,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-02-28 10:21:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-02-28 10:21:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-02-28 10:21:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-02-28 10:21:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-02-28 10:21:02,489 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-02-28 10:21:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:02,489 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-02-28 10:21:02,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-28 10:21:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-02-28 10:21:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-02-28 10:21:02,490 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:02,491 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-28 10:21:02,491 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:21:02,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:02,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-02-28 10:21:02,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:02,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:02,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:21:02,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:02,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:04,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:04,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:04,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:04,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:04,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:04,339 INFO L193 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 [2019-02-28 10:21:04,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:21:04,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:21:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:04,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-28 10:21:04,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:06,559 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:08,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:08,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-02-28 10:21:08,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:08,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-28 10:21:08,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-28 10:21:08,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-02-28 10:21:08,146 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-02-28 10:21:11,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:11,244 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-02-28 10:21:11,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-28 10:21:11,244 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-02-28 10:21:11,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:11,246 INFO L225 Difference]: With dead ends: 555 [2019-02-28 10:21:11,246 INFO L226 Difference]: Without dead ends: 264 [2019-02-28 10:21:11,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:21:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-02-28 10:21:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-02-28 10:21:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-02-28 10:21:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-02-28 10:21:11,308 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-02-28 10:21:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:11,308 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-02-28 10:21:11,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-28 10:21:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-02-28 10:21:11,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-02-28 10:21:11,309 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:11,309 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-28 10:21:11,309 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:21:11,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:11,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-02-28 10:21:11,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:11,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:11,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:21:11,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:11,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:14,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:14,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:14,754 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:14,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:14,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:14,755 INFO L193 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 [2019-02-28 10:21:14,763 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:21:14,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:21:14,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-28 10:21:14,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:21:14,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-28 10:21:14,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:23,151 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:31,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:31,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:31,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-02-28 10:21:31,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:31,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-02-28 10:21:31,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-02-28 10:21:31,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-02-28 10:21:31,042 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-02-28 10:22:02,473 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-28 10:22:03,195 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-28 10:22:03,936 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-28 10:22:04,602 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-28 10:22:05,272 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-28 10:22:05,947 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-28 10:22:06,569 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-28 10:22:07,173 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-28 10:22:07,777 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-28 10:22:08,338 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:22:08,884 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:22:09,414 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:22:09,943 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:22:10,498 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:22:11,039 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:22:11,521 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:22:11,982 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:22:12,426 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:22:12,865 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:22:13,289 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:22:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:17,516 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-02-28 10:22:17,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-02-28 10:22:17,516 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-02-28 10:22:17,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:17,518 INFO L225 Difference]: With dead ends: 705 [2019-02-28 10:22:17,518 INFO L226 Difference]: Without dead ends: 410 [2019-02-28 10:22:17,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 55.3s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-02-28 10:22:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-02-28 10:22:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-02-28 10:22:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-02-28 10:22:17,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-02-28 10:22:17,606 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-02-28 10:22:17,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:17,606 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-02-28 10:22:17,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-02-28 10:22:17,606 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-02-28 10:22:17,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-02-28 10:22:17,607 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:17,607 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-02-28 10:22:17,607 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:17,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:17,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-02-28 10:22:17,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:17,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:17,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:17,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:17,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:21,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:21,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:21,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:21,160 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:21,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:21,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:21,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:21,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:22:21,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:22:21,213 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:22:21,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:21,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 155 conjunts are in the unsatisfiable core [2019-02-28 10:22:21,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:24,640 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:24,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:24,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-02-28 10:22:24,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:24,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-28 10:22:24,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-28 10:22:24,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-02-28 10:22:24,971 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-02-28 10:22:40,913 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-28 10:22:41,634 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-28 10:22:42,264 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-28 10:22:42,739 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-02-28 10:22:43,190 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-28 10:22:43,625 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-28 10:22:44,056 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-28 10:22:44,471 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-28 10:22:44,879 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-28 10:22:45,260 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-28 10:22:45,638 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:22:46,004 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:22:46,421 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:22:46,785 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:22:47,133 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:22:47,477 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:22:47,800 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:22:48,120 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:22:48,422 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:22:48,725 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:22:49,016 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:22:49,555 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-28 10:22:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:52,252 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-02-28 10:22:52,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-02-28 10:22:52,253 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-02-28 10:22:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:52,254 INFO L225 Difference]: With dead ends: 574 [2019-02-28 10:22:52,254 INFO L226 Difference]: Without dead ends: 424 [2019-02-28 10:22:52,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-02-28 10:22:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-02-28 10:22:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-02-28 10:22:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-28 10:22:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-02-28 10:22:52,325 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-02-28 10:22:52,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:52,326 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-02-28 10:22:52,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-28 10:22:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-02-28 10:22:52,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-02-28 10:22:52,327 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:52,327 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-02-28 10:22:52,327 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:52,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-02-28 10:22:52,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:52,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:52,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:54,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:54,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:54,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:54,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:54,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:54,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:54,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:54,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:54,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-28 10:22:54,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:56,950 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:58,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:58,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2019-02-28 10:22:58,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:58,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-28 10:22:58,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-28 10:22:58,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2019-02-28 10:22:58,788 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2019-02-28 10:23:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:02,197 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2019-02-28 10:23:02,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-28 10:23:02,198 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2019-02-28 10:23:02,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:02,200 INFO L225 Difference]: With dead ends: 585 [2019-02-28 10:23:02,200 INFO L226 Difference]: Without dead ends: 278 [2019-02-28 10:23:02,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:23:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-02-28 10:23:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-02-28 10:23:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-28 10:23:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-02-28 10:23:02,277 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2019-02-28 10:23:02,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:02,278 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-02-28 10:23:02,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-28 10:23:02,278 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-02-28 10:23:02,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-02-28 10:23:02,279 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:02,279 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2019-02-28 10:23:02,279 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:02,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:02,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2019-02-28 10:23:02,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:02,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:02,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:02,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:02,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 38 proven. 5150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:05,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:05,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:05,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:05,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:05,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:05,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:05,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:23:05,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:23:05,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-28 10:23:05,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:05,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 84 conjunts are in the unsatisfiable core [2019-02-28 10:23:05,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2888 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:15,022 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:23,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2850 proven. 2338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:23,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:23,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 82, 82] total 203 [2019-02-28 10:23:23,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:23,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-02-28 10:23:23,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-02-28 10:23:23,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4394, Invalid=37018, Unknown=0, NotChecked=0, Total=41412 [2019-02-28 10:23:23,793 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 163 states.