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/20170304-DifficultPathPrograms/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:25:47,615 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:25:47,617 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:25:47,629 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:25:47,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:25:47,631 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:25:47,632 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:25:47,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:25:47,636 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:25:47,637 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:25:47,638 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:25:47,638 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:25:47,639 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:25:47,640 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:25:47,642 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:25:47,643 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:25:47,644 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:25:47,646 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:25:47,648 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:25:47,650 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:25:47,651 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:25:47,652 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:25:47,655 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:25:47,656 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:25:47,656 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:25:47,657 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:25:47,658 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:25:47,659 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:25:47,660 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:25:47,661 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:25:47,661 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:25:47,662 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:25:47,662 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:25:47,663 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:25:47,664 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:25:47,664 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:25:47,666 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-18 09:25:47,689 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:25:47,697 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:25:47,698 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:25:47,698 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:25:47,698 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:25:47,698 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:25:47,702 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:25:47,702 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:25:47,702 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-18 09:25:47,702 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:25:47,702 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-18 09:25:47,703 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-18 09:25:47,703 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:25:47,703 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:25:47,704 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:25:47,705 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:25:47,705 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:25:47,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:25:47,707 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:25:47,707 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:25:47,708 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:25:47,708 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:25:47,708 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:25:47,708 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:25:47,708 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:25:47,708 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:25:47,709 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:25:47,709 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:25:47,709 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:25:47,709 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:25:47,709 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:25:47,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:25:47,711 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:25:47,711 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:25:47,711 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:25:47,711 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:25:47,712 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:25:47,712 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:25:47,712 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:25:47,712 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:25:47,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:25:47,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:25:47,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:25:47,777 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:25:47,778 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:25:47,778 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl [2019-02-18 09:25:47,779 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2019-02-18 09:25:47,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:25:47,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:25:47,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:25:47,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:25:47,819 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:25:47,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:25:47,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:25:47,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:25:47,855 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:25:47,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:25:47,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:25:47,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:25:47,876 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:25:47,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:25:47,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:25:47,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:25:48,175 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:25:48,175 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-18 09:25:48,177 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:25:48 BoogieIcfgContainer [2019-02-18 09:25:48,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:25:48,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:25:48,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:25:48,182 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:25:48,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/2) ... [2019-02-18 09:25:48,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9153d6 and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:25:48, skipping insertion in model container [2019-02-18 09:25:48,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:25:48" (2/2) ... [2019-02-18 09:25:48,186 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2019-02-18 09:25:48,196 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:25:48,205 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-18 09:25:48,224 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-18 09:25:48,257 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:25:48,258 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:25:48,258 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:25:48,259 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:25:48,260 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:25:48,260 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:25:48,260 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:25:48,260 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:25:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-18 09:25:48,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:25:48,279 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:48,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:25:48,283 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:48,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:48,288 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-18 09:25:48,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:48,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:48,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:48,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:48,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:48,422 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-18 09:25:48,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:25:48,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 09:25:48,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:25:48,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:25:48,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:25:48,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:25:48,443 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-18 09:25:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:48,488 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-18 09:25:48,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:25:48,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 09:25:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:48,502 INFO L225 Difference]: With dead ends: 9 [2019-02-18 09:25:48,502 INFO L226 Difference]: Without dead ends: 5 [2019-02-18 09:25:48,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:25:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-18 09:25:48,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-18 09:25:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-18 09:25:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-18 09:25:48,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-18 09:25:48,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:48,538 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-18 09:25:48,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:25:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-18 09:25:48,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:25:48,539 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:48,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:25:48,540 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:48,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:48,541 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-02-18 09:25:48,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:48,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:48,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:48,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:48,795 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-18 09:25:48,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:48,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:48,797 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:25:48,799 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-02-18 09:25:48,868 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:25:48,868 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:25:49,044 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:25:49,045 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 5. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:25:49,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:49,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:25:49,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:49,059 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-18 09:25:49,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:49,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:25:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:49,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:49,112 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-18 09:25:49,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:49,173 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-18 09:25:49,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:49,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-18 09:25:49,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:49,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:25:49,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:25:49,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-18 09:25:49,215 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-02-18 09:25:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:49,247 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-18 09:25:49,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:25:49,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 09:25:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:49,248 INFO L225 Difference]: With dead ends: 8 [2019-02-18 09:25:49,249 INFO L226 Difference]: Without dead ends: 6 [2019-02-18 09:25:49,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-18 09:25:49,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-18 09:25:49,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-18 09:25:49,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-18 09:25:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-18 09:25:49,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-18 09:25:49,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:49,253 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-18 09:25:49,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:25:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-18 09:25:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:25:49,254 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:49,254 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-18 09:25:49,254 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:49,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:49,255 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-02-18 09:25:49,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:49,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:49,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:49,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:49,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:49,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:49,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:49,334 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:49,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:49,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:49,335 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-18 09:25:49,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:25:49,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:25:49,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-18 09:25:49,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:49,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:49,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:49,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:49,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-18 09:25:49,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:49,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 09:25:49,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 09:25:49,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:25:49,478 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-02-18 09:25:49,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:49,546 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-18 09:25:49,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:25:49,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-18 09:25:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:49,548 INFO L225 Difference]: With dead ends: 9 [2019-02-18 09:25:49,548 INFO L226 Difference]: Without dead ends: 7 [2019-02-18 09:25:49,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:25:49,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-18 09:25:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-18 09:25:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-18 09:25:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-18 09:25:49,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-18 09:25:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:49,551 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-18 09:25:49,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 09:25:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-18 09:25:49,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:25:49,552 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:49,552 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-18 09:25:49,553 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:49,553 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-02-18 09:25:49,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:49,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:49,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:49,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:49,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:49,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:49,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:49,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:49,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:49,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:49,739 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-18 09:25:49,756 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:25:49,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:25:49,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:25:49,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:49,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:49,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:50,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:50,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-18 09:25:50,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:50,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:25:50,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:25:50,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:25:50,024 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-02-18 09:25:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:50,037 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-18 09:25:50,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:25:50,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-18 09:25:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:50,038 INFO L225 Difference]: With dead ends: 10 [2019-02-18 09:25:50,038 INFO L226 Difference]: Without dead ends: 8 [2019-02-18 09:25:50,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:25:50,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-18 09:25:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-18 09:25:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-18 09:25:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-18 09:25:50,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-18 09:25:50,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:50,042 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-18 09:25:50,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:25:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-18 09:25:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:25:50,043 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:50,043 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-18 09:25:50,043 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:50,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:50,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-02-18 09:25:50,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:50,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:50,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:50,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:50,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:50,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:50,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:50,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:50,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:50,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:50,252 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-18 09:25:50,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:50,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:25:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:50,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:50,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:50,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:50,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-18 09:25:50,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:50,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:25:50,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:25:50,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:25:50,431 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-02-18 09:25:50,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:50,461 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-18 09:25:50,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:25:50,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-18 09:25:50,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:50,463 INFO L225 Difference]: With dead ends: 11 [2019-02-18 09:25:50,463 INFO L226 Difference]: Without dead ends: 9 [2019-02-18 09:25:50,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:25:50,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-18 09:25:50,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-18 09:25:50,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-18 09:25:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-18 09:25:50,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-02-18 09:25:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:50,470 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-18 09:25:50,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:25:50,470 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-18 09:25:50,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:25:50,470 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:50,471 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-02-18 09:25:50,471 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:50,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:50,471 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-02-18 09:25:50,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:50,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:50,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:50,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:50,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:50,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:50,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:50,578 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:50,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:50,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:50,578 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-18 09:25:50,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:25:50,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:25:50,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 09:25:50,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:50,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:50,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:51,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:51,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-18 09:25:51,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:51,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:25:51,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:25:51,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:25:51,055 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-02-18 09:25:51,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:51,090 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-18 09:25:51,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:25:51,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-02-18 09:25:51,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:51,092 INFO L225 Difference]: With dead ends: 12 [2019-02-18 09:25:51,092 INFO L226 Difference]: Without dead ends: 10 [2019-02-18 09:25:51,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:25:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-18 09:25:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-18 09:25:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-18 09:25:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-18 09:25:51,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-02-18 09:25:51,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:51,096 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-18 09:25:51,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:25:51,096 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-18 09:25:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:25:51,097 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:51,097 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-02-18 09:25:51,097 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:51,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:51,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-02-18 09:25:51,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:51,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:51,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:51,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:51,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:51,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:51,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:51,228 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:51,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:51,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:51,229 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-18 09:25:51,239 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:25:51,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:25:51,253 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:25:51,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:51,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:51,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:51,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:51,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-18 09:25:51,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:51,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:25:51,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:25:51,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:25:51,480 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-02-18 09:25:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:51,533 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-02-18 09:25:51,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:25:51,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-18 09:25:51,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:51,534 INFO L225 Difference]: With dead ends: 13 [2019-02-18 09:25:51,534 INFO L226 Difference]: Without dead ends: 11 [2019-02-18 09:25:51,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:25:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-18 09:25:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-18 09:25:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-18 09:25:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-18 09:25:51,537 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-02-18 09:25:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:51,538 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-18 09:25:51,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:25:51,538 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-18 09:25:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 09:25:51,538 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:51,538 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-02-18 09:25:51,539 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:51,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:51,539 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-02-18 09:25:51,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:51,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:51,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:51,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:51,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:51,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:51,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:51,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:51,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:51,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:51,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 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-18 09:25:51,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:51,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:25:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:51,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:51,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:51,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:51,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-18 09:25:51,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:51,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:25:51,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:25:51,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:25:51,984 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-02-18 09:25:52,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:52,016 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-18 09:25:52,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:25:52,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-02-18 09:25:52,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:52,023 INFO L225 Difference]: With dead ends: 14 [2019-02-18 09:25:52,023 INFO L226 Difference]: Without dead ends: 12 [2019-02-18 09:25:52,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:25:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-18 09:25:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-18 09:25:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-18 09:25:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-18 09:25:52,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-02-18 09:25:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:52,027 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-18 09:25:52,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:25:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-18 09:25:52,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-18 09:25:52,027 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:52,027 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-02-18 09:25:52,027 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:52,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:52,028 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-02-18 09:25:52,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:52,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:52,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:52,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:52,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:52,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:52,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:52,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:52,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:52,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:52,141 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-18 09:25:52,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:25:52,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:25:52,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-18 09:25:52,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:52,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:52,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:52,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:52,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-18 09:25:52,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:52,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:25:52,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:25:52,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:25:52,405 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-02-18 09:25:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:52,441 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-18 09:25:52,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:25:52,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-02-18 09:25:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:52,442 INFO L225 Difference]: With dead ends: 15 [2019-02-18 09:25:52,443 INFO L226 Difference]: Without dead ends: 13 [2019-02-18 09:25:52,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:25:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-18 09:25:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-18 09:25:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 09:25:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-18 09:25:52,447 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-02-18 09:25:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:52,447 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-18 09:25:52,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:25:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-18 09:25:52,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-18 09:25:52,447 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:52,448 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-02-18 09:25:52,448 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:52,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:52,448 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-02-18 09:25:52,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:52,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:52,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:52,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:52,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:52,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:52,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:52,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:52,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:52,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:52,658 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-18 09:25:52,668 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:25:52,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:25:52,682 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:25:52,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:52,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:52,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:52,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:52,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-18 09:25:52,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:52,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:25:52,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:25:52,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:25:52,932 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-02-18 09:25:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:52,982 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-02-18 09:25:52,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:25:52,983 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-02-18 09:25:52,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:52,984 INFO L225 Difference]: With dead ends: 16 [2019-02-18 09:25:52,984 INFO L226 Difference]: Without dead ends: 14 [2019-02-18 09:25:52,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:25:52,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-18 09:25:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-02-18 09:25:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-18 09:25:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-02-18 09:25:52,988 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-02-18 09:25:52,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:52,988 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-02-18 09:25:52,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:25:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-02-18 09:25:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-18 09:25:52,989 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:52,989 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-02-18 09:25:52,989 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:52,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:52,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-02-18 09:25:52,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:52,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:52,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:52,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:53,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:53,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:53,153 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:53,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:53,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:53,154 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-18 09:25:53,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:53,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:25:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:53,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:53,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:53,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:53,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-18 09:25:53,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:53,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:25:53,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:25:53,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:25:53,494 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-02-18 09:25:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:53,522 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-02-18 09:25:53,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-18 09:25:53,523 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-02-18 09:25:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:53,524 INFO L225 Difference]: With dead ends: 17 [2019-02-18 09:25:53,524 INFO L226 Difference]: Without dead ends: 15 [2019-02-18 09:25:53,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:25:53,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-18 09:25:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-18 09:25:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-18 09:25:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-02-18 09:25:53,528 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-02-18 09:25:53,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:53,528 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-02-18 09:25:53,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:25:53,528 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-02-18 09:25:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-18 09:25:53,528 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:53,529 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-02-18 09:25:53,529 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:53,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:53,529 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-02-18 09:25:53,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:53,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:53,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:53,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:53,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:53,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:53,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:53,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:53,842 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-18 09:25:53,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:25:53,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:25:53,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-18 09:25:53,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:53,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:53,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:54,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:54,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-18 09:25:54,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:54,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:25:54,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:25:54,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:25:54,457 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-02-18 09:25:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:54,486 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-18 09:25:54,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-18 09:25:54,491 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-02-18 09:25:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:54,492 INFO L225 Difference]: With dead ends: 18 [2019-02-18 09:25:54,492 INFO L226 Difference]: Without dead ends: 16 [2019-02-18 09:25:54,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:25:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-18 09:25:54,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-02-18 09:25:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-18 09:25:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-18 09:25:54,495 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-02-18 09:25:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:54,496 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-18 09:25:54,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:25:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-18 09:25:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-18 09:25:54,496 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:54,496 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-02-18 09:25:54,497 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:54,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:54,497 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-02-18 09:25:54,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:54,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:54,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:54,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:54,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:54,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:54,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:54,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:54,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:54,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:54,660 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-18 09:25:54,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:25:54,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:25:54,704 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:25:54,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:54,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:54,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:55,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:55,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-18 09:25:55,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:55,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-18 09:25:55,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-18 09:25:55,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-18 09:25:55,180 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-02-18 09:25:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:55,244 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-02-18 09:25:55,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-18 09:25:55,245 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-02-18 09:25:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:55,246 INFO L225 Difference]: With dead ends: 19 [2019-02-18 09:25:55,246 INFO L226 Difference]: Without dead ends: 17 [2019-02-18 09:25:55,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-18 09:25:55,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-18 09:25:55,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-18 09:25:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:25:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-18 09:25:55,251 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-02-18 09:25:55,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:55,251 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-18 09:25:55,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-18 09:25:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-18 09:25:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-18 09:25:55,252 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:55,252 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-02-18 09:25:55,253 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:55,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:55,253 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-02-18 09:25:55,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:55,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:55,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:55,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:55,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:55,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:55,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:55,423 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:55,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:55,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:55,424 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-18 09:25:55,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:55,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:25:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:55,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:55,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:55,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:55,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-18 09:25:55,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:55,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-18 09:25:55,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-18 09:25:55,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-18 09:25:55,883 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-02-18 09:25:55,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:55,913 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-18 09:25:55,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-18 09:25:55,920 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-02-18 09:25:55,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:55,921 INFO L225 Difference]: With dead ends: 20 [2019-02-18 09:25:55,921 INFO L226 Difference]: Without dead ends: 18 [2019-02-18 09:25:55,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-18 09:25:55,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-18 09:25:55,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-02-18 09:25:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-18 09:25:55,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-02-18 09:25:55,926 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-02-18 09:25:55,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:55,926 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-02-18 09:25:55,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-18 09:25:55,927 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-02-18 09:25:55,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-02-18 09:25:55,927 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:55,927 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-02-18 09:25:55,928 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:55,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:55,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-02-18 09:25:55,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:55,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:55,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:55,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:55,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:56,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:56,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:56,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:56,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:56,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:56,274 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-18 09:25:56,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:25:56,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:25:56,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-18 09:25:56,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:56,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:56,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:56,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:56,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-18 09:25:56,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:56,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-18 09:25:56,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-18 09:25:56,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:25:56,672 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-02-18 09:25:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:56,703 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-02-18 09:25:56,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-18 09:25:56,703 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-02-18 09:25:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:56,704 INFO L225 Difference]: With dead ends: 21 [2019-02-18 09:25:56,704 INFO L226 Difference]: Without dead ends: 19 [2019-02-18 09:25:56,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:25:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-18 09:25:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-18 09:25:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-18 09:25:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-02-18 09:25:56,709 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-02-18 09:25:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:56,710 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-02-18 09:25:56,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-18 09:25:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-02-18 09:25:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-18 09:25:56,711 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:56,711 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-02-18 09:25:56,711 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:56,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-02-18 09:25:56,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:56,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:56,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:56,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:56,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:56,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:56,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:56,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:56,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:56,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:56,982 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-18 09:25:56,994 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:25:56,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:25:57,012 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:25:57,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:57,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:57,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:57,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:57,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-18 09:25:57,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:57,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-18 09:25:57,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-18 09:25:57,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:25:57,665 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-02-18 09:25:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:57,700 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-02-18 09:25:57,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-18 09:25:57,701 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-02-18 09:25:57,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:57,701 INFO L225 Difference]: With dead ends: 22 [2019-02-18 09:25:57,701 INFO L226 Difference]: Without dead ends: 20 [2019-02-18 09:25:57,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:25:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-18 09:25:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-02-18 09:25:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-18 09:25:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-02-18 09:25:57,707 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-02-18 09:25:57,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:57,707 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-02-18 09:25:57,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-18 09:25:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-02-18 09:25:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-18 09:25:57,708 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:57,708 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-02-18 09:25:57,708 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:57,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:57,709 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-02-18 09:25:57,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:57,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:57,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:57,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:58,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:58,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:58,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:58,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:58,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:58,391 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-18 09:25:58,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:58,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:25:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:58,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:58,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:59,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:59,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-18 09:25:59,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:59,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-18 09:25:59,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-18 09:25:59,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-18 09:25:59,249 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-02-18 09:25:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:59,278 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-02-18 09:25:59,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-18 09:25:59,280 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-02-18 09:25:59,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:59,280 INFO L225 Difference]: With dead ends: 23 [2019-02-18 09:25:59,280 INFO L226 Difference]: Without dead ends: 21 [2019-02-18 09:25:59,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-18 09:25:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-18 09:25:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-18 09:25:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-18 09:25:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-18 09:25:59,285 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-02-18 09:25:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:59,285 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-18 09:25:59,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-18 09:25:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-18 09:25:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-18 09:25:59,286 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:59,286 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-02-18 09:25:59,286 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:59,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:59,286 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-02-18 09:25:59,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:59,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:59,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:59,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:59,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:59,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:59,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:59,496 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:59,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:59,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:59,496 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-18 09:25:59,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:25:59,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:25:59,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-18 09:25:59,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:59,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:59,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:00,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:00,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-18 09:26:00,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:00,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-18 09:26:00,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-18 09:26:00,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:26:00,280 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-02-18 09:26:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:00,309 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-18 09:26:00,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-18 09:26:00,309 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-02-18 09:26:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:00,310 INFO L225 Difference]: With dead ends: 24 [2019-02-18 09:26:00,310 INFO L226 Difference]: Without dead ends: 22 [2019-02-18 09:26:00,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:26:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-18 09:26:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-02-18 09:26:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-18 09:26:00,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-18 09:26:00,316 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-02-18 09:26:00,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:00,316 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-18 09:26:00,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-18 09:26:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-18 09:26:00,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-18 09:26:00,317 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:00,317 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-02-18 09:26:00,318 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:00,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:00,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-02-18 09:26:00,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:00,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:00,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:00,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:00,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:01,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:01,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:01,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:01,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:01,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:01,090 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-18 09:26:01,099 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:01,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:01,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:01,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:01,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:01,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:01,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:01,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-18 09:26:01,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:01,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-18 09:26:01,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-18 09:26:01,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:26:01,634 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-02-18 09:26:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:01,735 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-02-18 09:26:01,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-18 09:26:01,736 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-02-18 09:26:01,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:01,737 INFO L225 Difference]: With dead ends: 25 [2019-02-18 09:26:01,737 INFO L226 Difference]: Without dead ends: 23 [2019-02-18 09:26:01,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:26:01,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-18 09:26:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-18 09:26:01,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-18 09:26:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-02-18 09:26:01,742 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-02-18 09:26:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:01,742 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-02-18 09:26:01,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-18 09:26:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-02-18 09:26:01,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-18 09:26:01,743 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:01,743 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-02-18 09:26:01,743 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:01,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:01,743 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-02-18 09:26:01,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:01,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:01,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:01,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:01,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:02,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:02,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:02,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:02,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:02,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:02,081 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-18 09:26:02,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:02,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:02,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:02,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:02,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:02,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-18 09:26:02,678 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:02,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-18 09:26:02,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-18 09:26:02,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-18 09:26:02,679 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-02-18 09:26:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:02,767 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-18 09:26:02,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-18 09:26:02,768 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-02-18 09:26:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:02,769 INFO L225 Difference]: With dead ends: 26 [2019-02-18 09:26:02,769 INFO L226 Difference]: Without dead ends: 24 [2019-02-18 09:26:02,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-18 09:26:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-18 09:26:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-02-18 09:26:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-18 09:26:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-02-18 09:26:02,773 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-02-18 09:26:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:02,774 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-02-18 09:26:02,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-18 09:26:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-02-18 09:26:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-18 09:26:02,775 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:02,775 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-02-18 09:26:02,775 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:02,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:02,776 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-02-18 09:26:02,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:02,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:02,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:02,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:02,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:03,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:03,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:03,088 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:03,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:03,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:03,088 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-18 09:26:03,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:03,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:03,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-18 09:26:03,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:03,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:03,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:03,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:03,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-18 09:26:03,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:03,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-18 09:26:03,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-18 09:26:03,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:26:03,654 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-02-18 09:26:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:03,698 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-18 09:26:03,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-18 09:26:03,698 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-02-18 09:26:03,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:03,699 INFO L225 Difference]: With dead ends: 27 [2019-02-18 09:26:03,699 INFO L226 Difference]: Without dead ends: 25 [2019-02-18 09:26:03,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:26:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-18 09:26:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-18 09:26:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-18 09:26:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-18 09:26:03,703 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-02-18 09:26:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:03,703 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-18 09:26:03,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-18 09:26:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-18 09:26:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-18 09:26:03,710 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:03,710 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-02-18 09:26:03,711 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:03,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:03,711 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-02-18 09:26:03,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:03,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:03,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:03,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:03,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:04,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:04,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:04,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:04,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:04,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:04,448 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-18 09:26:04,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:04,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:04,478 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:04,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:04,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:04,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:05,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:05,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-18 09:26:05,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:05,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-18 09:26:05,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-18 09:26:05,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-18 09:26:05,078 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-02-18 09:26:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:05,148 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-02-18 09:26:05,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-18 09:26:05,150 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-02-18 09:26:05,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:05,151 INFO L225 Difference]: With dead ends: 28 [2019-02-18 09:26:05,151 INFO L226 Difference]: Without dead ends: 26 [2019-02-18 09:26:05,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-18 09:26:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-18 09:26:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-02-18 09:26:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 09:26:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-18 09:26:05,155 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-02-18 09:26:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:05,155 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-18 09:26:05,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-18 09:26:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-18 09:26:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-18 09:26:05,156 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:05,156 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-02-18 09:26:05,157 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-02-18 09:26:05,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:05,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:05,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:05,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:05,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:05,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:05,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:05,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:05,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:05,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:05,470 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-18 09:26:05,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:05,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:05,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:05,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:06,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:06,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-18 09:26:06,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:06,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-18 09:26:06,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-18 09:26:06,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-18 09:26:06,243 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-02-18 09:26:06,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:06,280 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-02-18 09:26:06,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-18 09:26:06,281 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-02-18 09:26:06,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:06,281 INFO L225 Difference]: With dead ends: 29 [2019-02-18 09:26:06,281 INFO L226 Difference]: Without dead ends: 27 [2019-02-18 09:26:06,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-18 09:26:06,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-18 09:26:06,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-18 09:26:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-18 09:26:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-02-18 09:26:06,286 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-02-18 09:26:06,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:06,286 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-02-18 09:26:06,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-18 09:26:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-02-18 09:26:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-18 09:26:06,287 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:06,287 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-02-18 09:26:06,287 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:06,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:06,288 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-02-18 09:26:06,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:06,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:06,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:06,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:06,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:07,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:07,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:07,270 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:07,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:07,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:07,270 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-18 09:26:07,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:07,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:07,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-18 09:26:07,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:07,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:07,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:08,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:08,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-18 09:26:08,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:08,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-18 09:26:08,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-18 09:26:08,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:26:08,257 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-02-18 09:26:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:08,301 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-18 09:26:08,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-18 09:26:08,302 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-02-18 09:26:08,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:08,302 INFO L225 Difference]: With dead ends: 30 [2019-02-18 09:26:08,302 INFO L226 Difference]: Without dead ends: 28 [2019-02-18 09:26:08,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:26:08,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-18 09:26:08,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-02-18 09:26:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-18 09:26:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-18 09:26:08,307 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-02-18 09:26:08,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:08,307 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-18 09:26:08,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-18 09:26:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-18 09:26:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-18 09:26:08,308 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:08,308 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-02-18 09:26:08,308 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:08,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:08,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-02-18 09:26:08,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:08,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:08,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:08,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:08,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:08,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:08,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:08,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:08,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:08,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:08,699 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-18 09:26:08,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:08,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:08,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:08,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:08,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:08,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:09,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:09,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-18 09:26:09,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:09,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-18 09:26:09,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-18 09:26:09,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-18 09:26:09,672 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-02-18 09:26:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:09,725 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-18 09:26:09,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-18 09:26:09,725 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-02-18 09:26:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:09,726 INFO L225 Difference]: With dead ends: 31 [2019-02-18 09:26:09,726 INFO L226 Difference]: Without dead ends: 29 [2019-02-18 09:26:09,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-18 09:26:09,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-18 09:26:09,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-18 09:26:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-18 09:26:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-02-18 09:26:09,731 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-02-18 09:26:09,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:09,732 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-02-18 09:26:09,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-18 09:26:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-02-18 09:26:09,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-18 09:26:09,732 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:09,732 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-02-18 09:26:09,733 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:09,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:09,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-02-18 09:26:09,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:09,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:09,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:09,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:09,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:10,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:10,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:10,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:10,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:10,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:10,162 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-18 09:26:10,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:10,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:10,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:10,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:11,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:11,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-18 09:26:11,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:11,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-18 09:26:11,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-18 09:26:11,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-18 09:26:11,979 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-02-18 09:26:12,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:12,036 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-02-18 09:26:12,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-18 09:26:12,036 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-02-18 09:26:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:12,037 INFO L225 Difference]: With dead ends: 32 [2019-02-18 09:26:12,037 INFO L226 Difference]: Without dead ends: 30 [2019-02-18 09:26:12,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-18 09:26:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-18 09:26:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-02-18 09:26:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-18 09:26:12,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-02-18 09:26:12,042 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-02-18 09:26:12,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:12,042 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-02-18 09:26:12,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-18 09:26:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-02-18 09:26:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-02-18 09:26:12,043 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:12,043 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-02-18 09:26:12,043 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:12,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:12,043 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-02-18 09:26:12,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:12,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:12,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:12,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:12,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:12,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:12,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:12,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:12,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:12,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:12,398 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-18 09:26:12,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:12,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:12,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-18 09:26:12,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:12,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:12,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:13,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:13,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-18 09:26:13,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:13,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-18 09:26:13,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-18 09:26:13,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-18 09:26:13,277 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-02-18 09:26:13,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:13,429 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-02-18 09:26:13,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-18 09:26:13,430 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-02-18 09:26:13,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:13,430 INFO L225 Difference]: With dead ends: 33 [2019-02-18 09:26:13,430 INFO L226 Difference]: Without dead ends: 31 [2019-02-18 09:26:13,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-18 09:26:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-18 09:26:13,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-18 09:26:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 09:26:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-02-18 09:26:13,434 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-02-18 09:26:13,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:13,434 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-02-18 09:26:13,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-18 09:26:13,435 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-02-18 09:26:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-18 09:26:13,435 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:13,435 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-02-18 09:26:13,435 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:13,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:13,436 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-02-18 09:26:13,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:13,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:13,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:13,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:13,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:14,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:14,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:14,621 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:14,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:14,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:14,622 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-18 09:26:14,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:14,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:14,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:14,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:14,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:14,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:15,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:15,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-18 09:26:15,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:15,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-18 09:26:15,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-18 09:26:15,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:26:15,557 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-02-18 09:26:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:15,589 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-02-18 09:26:15,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-18 09:26:15,590 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-02-18 09:26:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:15,590 INFO L225 Difference]: With dead ends: 34 [2019-02-18 09:26:15,590 INFO L226 Difference]: Without dead ends: 32 [2019-02-18 09:26:15,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:26:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-18 09:26:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-02-18 09:26:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-18 09:26:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-18 09:26:15,596 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-02-18 09:26:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:15,596 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-18 09:26:15,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-18 09:26:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-18 09:26:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-18 09:26:15,597 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:15,597 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-02-18 09:26:15,597 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-02-18 09:26:15,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:15,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:15,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:15,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:16,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:16,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:16,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:16,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:16,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:16,179 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-18 09:26:16,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:16,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:16,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:16,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:17,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:17,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-18 09:26:17,209 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:17,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-18 09:26:17,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-18 09:26:17,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-18 09:26:17,210 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-02-18 09:26:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:17,296 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-18 09:26:17,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-18 09:26:17,296 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-02-18 09:26:17,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:17,297 INFO L225 Difference]: With dead ends: 35 [2019-02-18 09:26:17,297 INFO L226 Difference]: Without dead ends: 33 [2019-02-18 09:26:17,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-18 09:26:17,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-18 09:26:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-18 09:26:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-18 09:26:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-02-18 09:26:17,302 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-02-18 09:26:17,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:17,302 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-02-18 09:26:17,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-18 09:26:17,303 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-02-18 09:26:17,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-18 09:26:17,303 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:17,303 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-02-18 09:26:17,303 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:17,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:17,303 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-02-18 09:26:17,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:17,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:17,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:17,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:17,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:17,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:17,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:17,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:17,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:17,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:17,812 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-18 09:26:17,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:17,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:17,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-18 09:26:17,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:17,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:17,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:18,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:18,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-18 09:26:18,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:18,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-18 09:26:18,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-18 09:26:18,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:26:18,884 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-02-18 09:26:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:18,936 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-18 09:26:18,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-18 09:26:18,937 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-02-18 09:26:18,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:18,938 INFO L225 Difference]: With dead ends: 36 [2019-02-18 09:26:18,938 INFO L226 Difference]: Without dead ends: 34 [2019-02-18 09:26:18,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:26:18,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-18 09:26:18,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-02-18 09:26:18,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-18 09:26:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-18 09:26:18,941 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-02-18 09:26:18,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:18,941 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-18 09:26:18,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-18 09:26:18,941 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-18 09:26:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-18 09:26:18,942 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:18,942 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-02-18 09:26:18,942 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:18,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:18,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-02-18 09:26:18,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:18,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:18,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:18,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:18,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:19,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:19,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:19,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:19,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:19,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:19,829 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-18 09:26:19,848 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:19,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:19,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:19,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:19,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:19,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:20,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:20,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-18 09:26:20,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:20,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-18 09:26:20,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-18 09:26:20,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:26:20,940 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-02-18 09:26:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:21,022 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-02-18 09:26:21,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-18 09:26:21,023 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-02-18 09:26:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:21,023 INFO L225 Difference]: With dead ends: 37 [2019-02-18 09:26:21,023 INFO L226 Difference]: Without dead ends: 35 [2019-02-18 09:26:21,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:26:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-18 09:26:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-18 09:26:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-18 09:26:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-02-18 09:26:21,026 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-02-18 09:26:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:21,026 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-02-18 09:26:21,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-18 09:26:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-02-18 09:26:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-18 09:26:21,027 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:21,027 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-02-18 09:26:21,027 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:21,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:21,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-02-18 09:26:21,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:21,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:21,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:21,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:21,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:21,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:21,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:21,476 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:21,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:21,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:21,476 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-18 09:26:21,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:21,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:21,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:21,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:22,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:22,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-18 09:26:22,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:22,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-18 09:26:22,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-18 09:26:22,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-18 09:26:22,601 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-02-18 09:26:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:22,669 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-02-18 09:26:22,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-18 09:26:22,670 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-02-18 09:26:22,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:22,670 INFO L225 Difference]: With dead ends: 38 [2019-02-18 09:26:22,671 INFO L226 Difference]: Without dead ends: 36 [2019-02-18 09:26:22,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-18 09:26:22,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-18 09:26:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-02-18 09:26:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-18 09:26:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-18 09:26:22,675 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-02-18 09:26:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:22,675 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-18 09:26:22,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-18 09:26:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-18 09:26:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-18 09:26:22,676 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:22,676 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-02-18 09:26:22,676 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:22,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:22,676 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-02-18 09:26:22,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:22,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:22,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:22,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:22,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:23,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:23,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:23,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:23,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:23,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:23,176 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-18 09:26:23,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:23,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:23,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-18 09:26:23,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:23,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:23,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:24,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:24,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-18 09:26:24,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:24,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-18 09:26:24,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-18 09:26:24,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-18 09:26:24,596 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-02-18 09:26:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:24,696 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-18 09:26:24,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-18 09:26:24,697 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-02-18 09:26:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:24,697 INFO L225 Difference]: With dead ends: 39 [2019-02-18 09:26:24,697 INFO L226 Difference]: Without dead ends: 37 [2019-02-18 09:26:24,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-18 09:26:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-18 09:26:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-18 09:26:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-18 09:26:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-18 09:26:24,700 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-02-18 09:26:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:24,701 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-18 09:26:24,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-18 09:26:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-18 09:26:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-18 09:26:24,701 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:24,701 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-02-18 09:26:24,701 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:24,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:24,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-02-18 09:26:24,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:24,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:24,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:24,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:24,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:25,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:25,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:25,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:25,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:25,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:25,207 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-18 09:26:25,216 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:25,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:25,257 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:25,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:25,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:25,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:26,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:26,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-18 09:26:26,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:26,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-18 09:26:26,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-18 09:26:26,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:26:26,501 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-02-18 09:26:26,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:26,610 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-18 09:26:26,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-18 09:26:26,610 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-02-18 09:26:26,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:26,611 INFO L225 Difference]: With dead ends: 40 [2019-02-18 09:26:26,611 INFO L226 Difference]: Without dead ends: 38 [2019-02-18 09:26:26,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:26:26,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-18 09:26:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-02-18 09:26:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 09:26:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-02-18 09:26:26,613 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-02-18 09:26:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:26,613 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-02-18 09:26:26,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-18 09:26:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-02-18 09:26:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-18 09:26:26,615 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:26,615 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-02-18 09:26:26,615 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:26,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:26,615 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-02-18 09:26:26,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:26,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:26,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:26,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:26,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:27,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:27,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:27,864 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:27,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:27,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:27,864 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-18 09:26:27,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:27,873 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:27,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:27,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:29,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:29,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-18 09:26:29,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:29,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-18 09:26:29,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-18 09:26:29,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-18 09:26:29,235 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-02-18 09:26:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:29,302 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-02-18 09:26:29,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-18 09:26:29,302 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-02-18 09:26:29,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:29,303 INFO L225 Difference]: With dead ends: 41 [2019-02-18 09:26:29,303 INFO L226 Difference]: Without dead ends: 39 [2019-02-18 09:26:29,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-18 09:26:29,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-18 09:26:29,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-18 09:26:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-18 09:26:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-02-18 09:26:29,307 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-02-18 09:26:29,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:29,307 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-02-18 09:26:29,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-18 09:26:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-02-18 09:26:29,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-18 09:26:29,308 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:29,308 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-02-18 09:26:29,308 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:29,308 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-02-18 09:26:29,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:29,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:29,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:29,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:29,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:30,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:30,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:30,190 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:30,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:30,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:30,190 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-18 09:26:30,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:30,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:30,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-18 09:26:30,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:30,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:30,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:31,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:31,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-18 09:26:31,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:31,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-18 09:26:31,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-18 09:26:31,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:26:31,706 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-02-18 09:26:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:31,755 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-18 09:26:31,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-18 09:26:31,755 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-02-18 09:26:31,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:31,756 INFO L225 Difference]: With dead ends: 42 [2019-02-18 09:26:31,756 INFO L226 Difference]: Without dead ends: 40 [2019-02-18 09:26:31,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:26:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-18 09:26:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-02-18 09:26:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-18 09:26:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-18 09:26:31,759 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-02-18 09:26:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:31,760 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-18 09:26:31,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-18 09:26:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-18 09:26:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-18 09:26:31,760 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:31,760 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-02-18 09:26:31,760 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:31,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-02-18 09:26:31,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:31,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:31,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:31,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:31,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:32,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:32,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:32,483 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:32,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:32,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:32,483 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-18 09:26:32,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:32,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:32,525 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:32,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:32,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:32,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:34,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:34,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-18 09:26:34,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:34,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-18 09:26:34,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-18 09:26:34,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-18 09:26:34,070 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-02-18 09:26:34,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:34,136 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-02-18 09:26:34,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-18 09:26:34,137 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-02-18 09:26:34,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:34,137 INFO L225 Difference]: With dead ends: 43 [2019-02-18 09:26:34,138 INFO L226 Difference]: Without dead ends: 41 [2019-02-18 09:26:34,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-18 09:26:34,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-18 09:26:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-18 09:26:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 09:26:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-18 09:26:34,140 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-02-18 09:26:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:34,140 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-18 09:26:34,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-18 09:26:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-18 09:26:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-18 09:26:34,141 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:34,141 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-02-18 09:26:34,141 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:34,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:34,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-02-18 09:26:34,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:34,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:34,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:34,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:34,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:34,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:34,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:34,935 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:34,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:34,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:34,935 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-18 09:26:34,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:34,944 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:34,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:34,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:36,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:36,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-18 09:26:36,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:36,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-18 09:26:36,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-18 09:26:36,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-18 09:26:36,715 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-02-18 09:26:36,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:36,801 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-02-18 09:26:36,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-18 09:26:36,801 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-02-18 09:26:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:36,802 INFO L225 Difference]: With dead ends: 44 [2019-02-18 09:26:36,802 INFO L226 Difference]: Without dead ends: 42 [2019-02-18 09:26:36,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-18 09:26:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-18 09:26:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-02-18 09:26:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-18 09:26:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-18 09:26:36,805 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-02-18 09:26:36,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:36,806 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-18 09:26:36,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-18 09:26:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-18 09:26:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-18 09:26:36,806 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:36,806 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-02-18 09:26:36,807 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:36,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-02-18 09:26:36,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:36,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:36,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:36,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:36,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:37,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:37,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:37,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:37,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:37,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:37,472 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-18 09:26:37,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:37,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:37,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-18 09:26:37,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:37,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:37,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:39,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:39,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-18 09:26:39,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:39,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-18 09:26:39,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-18 09:26:39,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:26:39,227 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-02-18 09:26:39,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:39,292 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-02-18 09:26:39,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-18 09:26:39,293 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-02-18 09:26:39,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:39,293 INFO L225 Difference]: With dead ends: 45 [2019-02-18 09:26:39,294 INFO L226 Difference]: Without dead ends: 43 [2019-02-18 09:26:39,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:26:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-18 09:26:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-18 09:26:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-18 09:26:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-02-18 09:26:39,297 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-02-18 09:26:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:39,297 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-02-18 09:26:39,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-18 09:26:39,298 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-02-18 09:26:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-18 09:26:39,298 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:39,298 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-02-18 09:26:39,298 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:39,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-02-18 09:26:39,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:39,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:39,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:39,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:39,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:40,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:40,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:40,335 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:40,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:40,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:40,335 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-18 09:26:40,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:40,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:40,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:40,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:40,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:40,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:42,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:42,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-18 09:26:42,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:42,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-18 09:26:42,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-18 09:26:42,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-18 09:26:42,047 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-02-18 09:26:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:42,115 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-18 09:26:42,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-18 09:26:42,116 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-02-18 09:26:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:42,116 INFO L225 Difference]: With dead ends: 46 [2019-02-18 09:26:42,116 INFO L226 Difference]: Without dead ends: 44 [2019-02-18 09:26:42,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-18 09:26:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-18 09:26:42,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-02-18 09:26:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-18 09:26:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-02-18 09:26:42,119 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-02-18 09:26:42,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:42,119 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-02-18 09:26:42,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-18 09:26:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-02-18 09:26:42,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-18 09:26:42,120 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:42,120 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-02-18 09:26:42,120 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:42,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:42,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-02-18 09:26:42,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:42,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:42,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:42,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:42,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:42,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:42,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:42,901 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:42,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:42,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:42,901 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-18 09:26:42,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:42,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:42,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:42,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:44,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:44,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-18 09:26:44,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:44,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-18 09:26:44,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-18 09:26:44,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-18 09:26:44,767 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-02-18 09:26:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:44,857 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-02-18 09:26:44,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-18 09:26:44,859 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-02-18 09:26:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:44,860 INFO L225 Difference]: With dead ends: 47 [2019-02-18 09:26:44,860 INFO L226 Difference]: Without dead ends: 45 [2019-02-18 09:26:44,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-18 09:26:44,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-18 09:26:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-18 09:26:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-18 09:26:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-02-18 09:26:44,862 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-02-18 09:26:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:44,862 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-02-18 09:26:44,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-18 09:26:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-02-18 09:26:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-18 09:26:44,863 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:44,863 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-02-18 09:26:44,863 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:44,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:44,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-02-18 09:26:44,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:44,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:44,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:44,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:44,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:45,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:45,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:45,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:45,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:45,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:45,856 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-18 09:26:45,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:45,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:46,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-18 09:26:46,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:46,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:46,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:47,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:47,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-18 09:26:47,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:47,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-18 09:26:47,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-18 09:26:47,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:26:47,901 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-02-18 09:26:47,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:47,978 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-18 09:26:47,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-18 09:26:47,979 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-02-18 09:26:47,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:47,979 INFO L225 Difference]: With dead ends: 48 [2019-02-18 09:26:47,979 INFO L226 Difference]: Without dead ends: 46 [2019-02-18 09:26:47,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:26:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-18 09:26:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-02-18 09:26:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-18 09:26:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-18 09:26:47,981 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-02-18 09:26:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:47,981 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-18 09:26:47,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-18 09:26:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-18 09:26:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-18 09:26:47,982 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:47,982 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-02-18 09:26:47,982 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-02-18 09:26:47,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:47,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:47,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:47,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:47,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:48,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:48,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:48,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:48,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:48,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:48,750 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-18 09:26:48,758 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:48,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:48,805 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:48,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:48,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:48,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:51,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:51,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-18 09:26:51,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:51,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-18 09:26:51,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-18 09:26:51,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-18 09:26:51,117 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-02-18 09:26:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:51,169 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-02-18 09:26:51,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-18 09:26:51,169 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-02-18 09:26:51,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:51,170 INFO L225 Difference]: With dead ends: 49 [2019-02-18 09:26:51,170 INFO L226 Difference]: Without dead ends: 47 [2019-02-18 09:26:51,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-18 09:26:51,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-18 09:26:51,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-18 09:26:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-18 09:26:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-02-18 09:26:51,174 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-02-18 09:26:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:51,174 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-02-18 09:26:51,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-18 09:26:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-02-18 09:26:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-18 09:26:51,174 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:51,175 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-02-18 09:26:51,175 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:51,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:51,175 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-02-18 09:26:51,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:51,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:51,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:51,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:51,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:51,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:51,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:51,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:51,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:51,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:51,952 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-18 09:26:51,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:51,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:52,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:52,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:54,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:54,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-18 09:26:54,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:54,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-18 09:26:54,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-18 09:26:54,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-18 09:26:54,137 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-02-18 09:26:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:54,208 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-18 09:26:54,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-18 09:26:54,209 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-02-18 09:26:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:54,209 INFO L225 Difference]: With dead ends: 50 [2019-02-18 09:26:54,210 INFO L226 Difference]: Without dead ends: 48 [2019-02-18 09:26:54,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-18 09:26:54,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-18 09:26:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-02-18 09:26:54,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-18 09:26:54,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-02-18 09:26:54,212 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-02-18 09:26:54,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:54,212 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-02-18 09:26:54,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-18 09:26:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-02-18 09:26:54,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-18 09:26:54,213 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:54,213 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-02-18 09:26:54,213 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:54,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:54,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-02-18 09:26:54,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:54,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:54,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:54,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:54,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:55,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:55,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:55,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:55,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:55,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:55,081 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-18 09:26:55,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:55,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:55,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-18 09:26:55,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:55,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:55,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:57,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:57,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-18 09:26:57,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:57,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-18 09:26:57,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-18 09:26:57,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:26:57,496 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-02-18 09:26:57,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:57,602 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-18 09:26:57,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-18 09:26:57,603 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-02-18 09:26:57,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:57,603 INFO L225 Difference]: With dead ends: 51 [2019-02-18 09:26:57,603 INFO L226 Difference]: Without dead ends: 49 [2019-02-18 09:26:57,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:26:57,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-18 09:26:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-18 09:26:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-18 09:26:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-18 09:26:57,608 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-02-18 09:26:57,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:57,609 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-18 09:26:57,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-18 09:26:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-18 09:26:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-18 09:26:57,610 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:57,610 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-02-18 09:26:57,610 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:57,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:57,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-02-18 09:26:57,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:57,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:57,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:57,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:57,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:58,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:58,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:58,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:58,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:58,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:58,532 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-18 09:26:58,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:58,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:58,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:58,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:58,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:58,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:01,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:01,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-18 09:27:01,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:01,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-18 09:27:01,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-18 09:27:01,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:27:01,136 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-02-18 09:27:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:01,528 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-02-18 09:27:01,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-18 09:27:01,528 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-02-18 09:27:01,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:01,529 INFO L225 Difference]: With dead ends: 52 [2019-02-18 09:27:01,529 INFO L226 Difference]: Without dead ends: 50 [2019-02-18 09:27:01,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:27:01,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-18 09:27:01,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-02-18 09:27:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-18 09:27:01,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-02-18 09:27:01,532 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-02-18 09:27:01,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:01,532 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-02-18 09:27:01,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-18 09:27:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-02-18 09:27:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-02-18 09:27:01,533 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:01,533 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-02-18 09:27:01,533 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:01,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:01,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-02-18 09:27:01,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:01,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:01,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:01,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:01,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:02,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:02,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:02,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:02,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:02,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:02,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:02,712 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-18 09:27:02,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:02,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:02,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:02,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:05,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:05,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-18 09:27:05,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:05,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-18 09:27:05,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-18 09:27:05,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-18 09:27:05,072 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-02-18 09:27:05,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:05,168 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-02-18 09:27:05,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-18 09:27:05,169 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-02-18 09:27:05,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:05,170 INFO L225 Difference]: With dead ends: 53 [2019-02-18 09:27:05,170 INFO L226 Difference]: Without dead ends: 51 [2019-02-18 09:27:05,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-18 09:27:05,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-18 09:27:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-18 09:27:05,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-18 09:27:05,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-02-18 09:27:05,174 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-02-18 09:27:05,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:05,174 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-02-18 09:27:05,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-18 09:27:05,174 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-02-18 09:27:05,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-18 09:27:05,175 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:05,175 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-02-18 09:27:05,175 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:05,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:05,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-02-18 09:27:05,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:05,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:05,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:05,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:05,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:06,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:06,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:06,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:06,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:06,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:06,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 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-18 09:27:06,468 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:06,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:06,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-18 09:27:06,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:06,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:06,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:09,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:09,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-18 09:27:09,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:09,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-18 09:27:09,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-18 09:27:09,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:27:09,062 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-02-18 09:27:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:09,128 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-18 09:27:09,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-18 09:27:09,128 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-02-18 09:27:09,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:09,129 INFO L225 Difference]: With dead ends: 54 [2019-02-18 09:27:09,130 INFO L226 Difference]: Without dead ends: 52 [2019-02-18 09:27:09,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:27:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-18 09:27:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-02-18 09:27:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-18 09:27:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-18 09:27:09,134 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-02-18 09:27:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:09,134 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-18 09:27:09,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-18 09:27:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-18 09:27:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-18 09:27:09,135 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:09,135 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-02-18 09:27:09,135 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:09,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:09,136 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-02-18 09:27:09,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:09,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:09,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:09,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:09,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:10,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:10,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:10,190 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:10,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:10,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:10,190 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-18 09:27:10,199 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:10,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:10,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:10,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:10,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:10,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:13,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:13,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-18 09:27:13,020 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:13,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-18 09:27:13,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-18 09:27:13,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-18 09:27:13,022 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-02-18 09:27:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:13,153 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-18 09:27:13,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-18 09:27:13,153 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-02-18 09:27:13,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:13,154 INFO L225 Difference]: With dead ends: 55 [2019-02-18 09:27:13,154 INFO L226 Difference]: Without dead ends: 53 [2019-02-18 09:27:13,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-18 09:27:13,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-18 09:27:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-18 09:27:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-18 09:27:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-02-18 09:27:13,157 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-02-18 09:27:13,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:13,158 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-02-18 09:27:13,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-18 09:27:13,158 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-02-18 09:27:13,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-18 09:27:13,159 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:13,159 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-02-18 09:27:13,159 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:13,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:13,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-02-18 09:27:13,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:13,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:13,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:13,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:13,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:14,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:14,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:14,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:14,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:14,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:14,235 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-18 09:27:14,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:14,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:14,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:14,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:17,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:17,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-18 09:27:17,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:17,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-18 09:27:17,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-18 09:27:17,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-18 09:27:17,472 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-02-18 09:27:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:17,546 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-18 09:27:17,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-18 09:27:17,546 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-02-18 09:27:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:17,547 INFO L225 Difference]: With dead ends: 56 [2019-02-18 09:27:17,547 INFO L226 Difference]: Without dead ends: 54 [2019-02-18 09:27:17,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-18 09:27:17,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-18 09:27:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-02-18 09:27:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-18 09:27:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-02-18 09:27:17,550 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-02-18 09:27:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:17,551 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-02-18 09:27:17,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-18 09:27:17,551 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-02-18 09:27:17,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-02-18 09:27:17,552 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:17,552 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-02-18 09:27:17,552 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:17,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:17,552 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-02-18 09:27:17,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:17,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:17,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:17,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:17,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:18,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:18,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:18,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:18,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:18,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:18,571 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-18 09:27:18,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:18,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:18,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-18 09:27:18,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:18,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:18,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:21,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:21,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-18 09:27:21,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:21,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-18 09:27:21,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-18 09:27:21,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:27:21,869 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-02-18 09:27:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:22,018 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-02-18 09:27:22,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-18 09:27:22,018 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-02-18 09:27:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:22,019 INFO L225 Difference]: With dead ends: 57 [2019-02-18 09:27:22,019 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 09:27:22,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:27:22,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 09:27:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-18 09:27:22,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-18 09:27:22,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-02-18 09:27:22,022 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-02-18 09:27:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:22,022 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-02-18 09:27:22,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-18 09:27:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-02-18 09:27:22,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-18 09:27:22,022 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:22,023 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-02-18 09:27:22,023 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:22,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:22,023 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-02-18 09:27:22,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:22,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:22,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:22,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:22,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:23,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:23,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:23,052 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:23,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:23,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:23,052 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-18 09:27:23,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:23,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:23,108 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:23,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:23,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:23,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:26,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:26,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-18 09:27:26,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:26,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-18 09:27:26,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-18 09:27:26,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:27:26,152 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-02-18 09:27:26,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:26,269 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-02-18 09:27:26,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-18 09:27:26,270 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-02-18 09:27:26,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:26,270 INFO L225 Difference]: With dead ends: 58 [2019-02-18 09:27:26,270 INFO L226 Difference]: Without dead ends: 56 [2019-02-18 09:27:26,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:27:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-18 09:27:26,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-02-18 09:27:26,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-18 09:27:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-18 09:27:26,273 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-02-18 09:27:26,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:26,273 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-18 09:27:26,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-18 09:27:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-18 09:27:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-18 09:27:26,274 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:26,274 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-02-18 09:27:26,274 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:26,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:26,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-02-18 09:27:26,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:26,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:26,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:26,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:26,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:27,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:27,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:27,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:27,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:27,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:27,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 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-18 09:27:27,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:27,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:27,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:27,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:30,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:30,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-18 09:27:30,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:30,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-18 09:27:30,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-18 09:27:30,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-18 09:27:30,231 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-02-18 09:27:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:30,331 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-02-18 09:27:30,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-18 09:27:30,332 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-02-18 09:27:30,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:30,332 INFO L225 Difference]: With dead ends: 59 [2019-02-18 09:27:30,332 INFO L226 Difference]: Without dead ends: 57 [2019-02-18 09:27:30,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-18 09:27:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-18 09:27:30,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-18 09:27:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-18 09:27:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-18 09:27:30,335 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-02-18 09:27:30,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:30,336 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-18 09:27:30,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-18 09:27:30,336 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-18 09:27:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-18 09:27:30,336 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:30,336 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-02-18 09:27:30,337 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:30,337 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-02-18 09:27:30,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:30,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:30,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:30,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:30,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:31,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:31,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:31,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:31,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:31,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:31,546 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-18 09:27:31,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:31,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:31,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-18 09:27:31,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:31,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:31,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:34,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:34,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:34,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-18 09:27:34,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:34,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-18 09:27:34,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-18 09:27:34,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-18 09:27:34,837 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-02-18 09:27:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:34,906 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-18 09:27:34,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-18 09:27:34,906 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-02-18 09:27:34,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:34,907 INFO L225 Difference]: With dead ends: 60 [2019-02-18 09:27:34,907 INFO L226 Difference]: Without dead ends: 58 [2019-02-18 09:27:34,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-18 09:27:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-18 09:27:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-02-18 09:27:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-18 09:27:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-18 09:27:34,910 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-02-18 09:27:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:34,911 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-18 09:27:34,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-18 09:27:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-18 09:27:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-18 09:27:34,911 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:34,911 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-02-18 09:27:34,911 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:34,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-02-18 09:27:34,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:34,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:34,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:34,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:34,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:36,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:36,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:36,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:36,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:36,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:36,521 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-18 09:27:36,529 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:36,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:36,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:36,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:36,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:36,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:39,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:39,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-18 09:27:39,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:39,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-18 09:27:39,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-18 09:27:39,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-18 09:27:39,741 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-02-18 09:27:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:39,834 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-02-18 09:27:39,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-18 09:27:39,834 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-02-18 09:27:39,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:39,835 INFO L225 Difference]: With dead ends: 61 [2019-02-18 09:27:39,835 INFO L226 Difference]: Without dead ends: 59 [2019-02-18 09:27:39,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-18 09:27:39,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-18 09:27:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-18 09:27:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-18 09:27:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-02-18 09:27:39,838 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-02-18 09:27:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:39,838 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-02-18 09:27:39,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-18 09:27:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-02-18 09:27:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-18 09:27:39,839 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:39,839 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-02-18 09:27:39,839 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:39,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:39,840 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-02-18 09:27:39,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:39,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:39,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:39,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:39,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:41,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:41,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:41,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:41,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:41,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:41,883 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-18 09:27:41,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:41,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:41,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:41,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:45,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:45,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-18 09:27:45,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:45,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-18 09:27:45,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-18 09:27:45,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-18 09:27:45,127 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-02-18 09:27:45,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:45,242 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-02-18 09:27:45,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-18 09:27:45,242 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-02-18 09:27:45,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:45,243 INFO L225 Difference]: With dead ends: 62 [2019-02-18 09:27:45,243 INFO L226 Difference]: Without dead ends: 60 [2019-02-18 09:27:45,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-18 09:27:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-18 09:27:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-02-18 09:27:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-18 09:27:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-02-18 09:27:45,246 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-02-18 09:27:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:45,247 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-02-18 09:27:45,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-18 09:27:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-02-18 09:27:45,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-18 09:27:45,247 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:45,248 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-02-18 09:27:45,248 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:45,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:45,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-02-18 09:27:45,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:45,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:45,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:45,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:45,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:46,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:46,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:46,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:46,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:46,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:46,689 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-18 09:27:46,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:46,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:46,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-18 09:27:46,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:46,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:46,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:50,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:50,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-18 09:27:50,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:50,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-18 09:27:50,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-18 09:27:50,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-18 09:27:50,321 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-02-18 09:27:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:50,398 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-18 09:27:50,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-18 09:27:50,399 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-02-18 09:27:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:50,400 INFO L225 Difference]: With dead ends: 63 [2019-02-18 09:27:50,400 INFO L226 Difference]: Without dead ends: 61 [2019-02-18 09:27:50,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-18 09:27:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-18 09:27:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-18 09:27:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 09:27:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-18 09:27:50,404 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-02-18 09:27:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:50,404 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-18 09:27:50,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-18 09:27:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-18 09:27:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-18 09:27:50,405 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:50,405 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-02-18 09:27:50,405 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:50,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:50,406 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-02-18 09:27:50,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:50,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:50,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:50,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:50,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:51,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:51,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:51,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:51,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:51,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:51,977 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-18 09:27:51,984 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:51,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:52,034 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:52,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:52,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:52,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:56,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:56,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-18 09:27:56,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:56,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-18 09:27:56,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-18 09:27:56,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-18 09:27:56,634 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-02-18 09:27:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:56,826 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-02-18 09:27:56,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-18 09:27:56,827 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-02-18 09:27:56,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:56,827 INFO L225 Difference]: With dead ends: 64 [2019-02-18 09:27:56,827 INFO L226 Difference]: Without dead ends: 62 [2019-02-18 09:27:56,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-18 09:27:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-18 09:27:56,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-02-18 09:27:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-18 09:27:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-18 09:27:56,831 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-02-18 09:27:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:56,831 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-18 09:27:56,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-18 09:27:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-18 09:27:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-18 09:27:56,831 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:56,831 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-02-18 09:27:56,832 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:56,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:56,832 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-02-18 09:27:56,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:56,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:56,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:56,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:56,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:58,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:58,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:58,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:58,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:58,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:58,359 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-18 09:27:58,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:58,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:58,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:58,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:02,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:02,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-18 09:28:02,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:02,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-18 09:28:02,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-18 09:28:02,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-18 09:28:02,621 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-02-18 09:28:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:02,710 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-02-18 09:28:02,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-18 09:28:02,710 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-02-18 09:28:02,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:02,711 INFO L225 Difference]: With dead ends: 65 [2019-02-18 09:28:02,711 INFO L226 Difference]: Without dead ends: 63 [2019-02-18 09:28:02,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-18 09:28:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-18 09:28:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-18 09:28:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-18 09:28:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-02-18 09:28:02,715 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-02-18 09:28:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:02,715 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-02-18 09:28:02,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-18 09:28:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-02-18 09:28:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-18 09:28:02,715 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:02,715 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-02-18 09:28:02,716 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:02,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:02,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-02-18 09:28:02,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:02,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:02,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:02,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:02,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:04,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:04,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:04,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:04,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:04,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:04,235 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-18 09:28:04,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:28:04,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:28:04,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-18 09:28:04,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:04,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:04,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:08,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:08,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-18 09:28:08,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:08,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-18 09:28:08,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-18 09:28:08,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-18 09:28:08,550 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-02-18 09:28:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:08,627 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-18 09:28:08,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-18 09:28:08,627 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-02-18 09:28:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:08,628 INFO L225 Difference]: With dead ends: 66 [2019-02-18 09:28:08,628 INFO L226 Difference]: Without dead ends: 64 [2019-02-18 09:28:08,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-18 09:28:08,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-18 09:28:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-02-18 09:28:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-18 09:28:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-18 09:28:08,631 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-02-18 09:28:08,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:08,631 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-18 09:28:08,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-18 09:28:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-18 09:28:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-18 09:28:08,632 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:08,632 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-02-18 09:28:08,632 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:08,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:08,632 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-02-18 09:28:08,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:08,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:08,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:08,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:08,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:09,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:09,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:09,977 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:09,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:09,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:09,977 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-18 09:28:09,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:28:09,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:28:10,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:28:10,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:10,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:10,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:14,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:14,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-18 09:28:14,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:14,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-18 09:28:14,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-18 09:28:14,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-18 09:28:14,151 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-02-18 09:28:14,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:14,288 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-02-18 09:28:14,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-18 09:28:14,288 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-02-18 09:28:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:14,289 INFO L225 Difference]: With dead ends: 67 [2019-02-18 09:28:14,289 INFO L226 Difference]: Without dead ends: 65 [2019-02-18 09:28:14,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-18 09:28:14,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-18 09:28:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-18 09:28:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-18 09:28:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-02-18 09:28:14,293 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-02-18 09:28:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:14,293 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-02-18 09:28:14,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-18 09:28:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-02-18 09:28:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-18 09:28:14,294 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:14,294 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-02-18 09:28:14,294 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:14,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:14,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-02-18 09:28:14,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:14,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:14,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:14,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:14,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:15,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:15,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:15,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:15,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:15,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:15,833 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-18 09:28:15,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:15,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:28:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:15,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:15,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:20,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:20,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-18 09:28:20,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:20,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-18 09:28:20,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-18 09:28:20,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-18 09:28:20,133 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-02-18 09:28:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:20,258 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-02-18 09:28:20,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-18 09:28:20,258 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-02-18 09:28:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:20,259 INFO L225 Difference]: With dead ends: 68 [2019-02-18 09:28:20,259 INFO L226 Difference]: Without dead ends: 66 [2019-02-18 09:28:20,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-18 09:28:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-02-18 09:28:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-02-18 09:28:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-18 09:28:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-18 09:28:20,262 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-02-18 09:28:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:20,262 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-18 09:28:20,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-18 09:28:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-18 09:28:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-18 09:28:20,263 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:20,263 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-02-18 09:28:20,263 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:20,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:20,264 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-02-18 09:28:20,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:20,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:20,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:20,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:20,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:21,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:21,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:21,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:21,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:21,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:21,675 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-18 09:28:21,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:28:21,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:28:22,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-18 09:28:22,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:22,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:22,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:26,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:26,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-18 09:28:26,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:26,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-18 09:28:26,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-18 09:28:26,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-18 09:28:26,488 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-02-18 09:28:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:26,605 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-02-18 09:28:26,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-18 09:28:26,605 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-02-18 09:28:26,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:26,606 INFO L225 Difference]: With dead ends: 69 [2019-02-18 09:28:26,606 INFO L226 Difference]: Without dead ends: 67 [2019-02-18 09:28:26,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-18 09:28:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-18 09:28:26,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-18 09:28:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-18 09:28:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-02-18 09:28:26,609 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-02-18 09:28:26,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:26,610 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-02-18 09:28:26,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-18 09:28:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-02-18 09:28:26,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-18 09:28:26,611 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:26,611 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-02-18 09:28:26,611 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:26,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:26,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-02-18 09:28:26,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:26,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:26,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:26,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:26,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:28,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:28,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:28,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:28,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:28,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:28,385 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-18 09:28:28,396 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:28:28,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:28:28,465 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:28:28,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:28,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:28,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:32,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:32,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-18 09:28:32,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:32,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-18 09:28:32,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-18 09:28:32,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-18 09:28:32,962 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-02-18 09:28:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:33,079 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-18 09:28:33,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-18 09:28:33,081 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-02-18 09:28:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:33,082 INFO L225 Difference]: With dead ends: 70 [2019-02-18 09:28:33,082 INFO L226 Difference]: Without dead ends: 68 [2019-02-18 09:28:33,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-18 09:28:33,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-18 09:28:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-02-18 09:28:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-18 09:28:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-02-18 09:28:33,086 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-02-18 09:28:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:33,087 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-02-18 09:28:33,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-18 09:28:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-02-18 09:28:33,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-18 09:28:33,087 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:33,088 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-02-18 09:28:33,088 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:33,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:33,088 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-02-18 09:28:33,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:33,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:33,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:33,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:33,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:34,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:34,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:34,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:34,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:34,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:34,708 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-18 09:28:34,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:34,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:28:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:34,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:34,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:39,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:39,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:39,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-18 09:28:39,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:39,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-18 09:28:39,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-18 09:28:39,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-18 09:28:39,445 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-02-18 09:28:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:39,538 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-18 09:28:39,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-18 09:28:39,539 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-02-18 09:28:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:39,540 INFO L225 Difference]: With dead ends: 71 [2019-02-18 09:28:39,540 INFO L226 Difference]: Without dead ends: 69 [2019-02-18 09:28:39,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-18 09:28:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-18 09:28:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-18 09:28:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-18 09:28:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-02-18 09:28:39,544 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-02-18 09:28:39,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:39,545 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-02-18 09:28:39,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-18 09:28:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-02-18 09:28:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-18 09:28:39,545 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:39,545 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-02-18 09:28:39,546 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:39,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:39,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-02-18 09:28:39,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:39,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:39,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:39,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:39,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:41,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:41,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:41,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:41,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:41,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:41,714 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-18 09:28:41,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:28:41,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:28:42,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-18 09:28:42,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:42,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:42,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:46,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:46,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-18 09:28:46,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:46,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-18 09:28:46,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-18 09:28:46,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 09:28:46,867 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-02-18 09:28:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:46,974 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-18 09:28:46,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-18 09:28:46,974 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-02-18 09:28:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:46,975 INFO L225 Difference]: With dead ends: 72 [2019-02-18 09:28:46,975 INFO L226 Difference]: Without dead ends: 70 [2019-02-18 09:28:46,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 09:28:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-18 09:28:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-02-18 09:28:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-18 09:28:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-18 09:28:46,978 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-02-18 09:28:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:46,978 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-18 09:28:46,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-18 09:28:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-18 09:28:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-18 09:28:46,978 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:46,978 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-02-18 09:28:46,979 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:46,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-02-18 09:28:46,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:46,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:46,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:46,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:46,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:48,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:48,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:48,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:48,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:48,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:48,877 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-18 09:28:48,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:28:48,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:28:48,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:28:48,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:48,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:48,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:56,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:56,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-18 09:28:56,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:56,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-18 09:28:56,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-18 09:28:56,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-18 09:28:56,484 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-02-18 09:28:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:56,767 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-02-18 09:28:56,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-18 09:28:56,767 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-02-18 09:28:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:56,768 INFO L225 Difference]: With dead ends: 73 [2019-02-18 09:28:56,768 INFO L226 Difference]: Without dead ends: 71 [2019-02-18 09:28:56,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-18 09:28:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-18 09:28:56,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-18 09:28:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-18 09:28:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-02-18 09:28:56,770 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-02-18 09:28:56,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:56,771 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-02-18 09:28:56,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-18 09:28:56,771 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-02-18 09:28:56,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-18 09:28:56,771 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:56,772 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-02-18 09:28:56,772 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:56,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:56,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-02-18 09:28:56,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:56,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:56,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:56,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:56,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:58,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:58,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:58,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:58,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:58,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:58,858 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:28:58,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:58,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:28:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:58,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:58,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:04,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:04,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-18 09:29:04,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:04,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-18 09:29:04,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-18 09:29:04,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-18 09:29:04,208 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-02-18 09:29:04,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:04,308 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-02-18 09:29:04,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-18 09:29:04,308 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-02-18 09:29:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:04,309 INFO L225 Difference]: With dead ends: 74 [2019-02-18 09:29:04,309 INFO L226 Difference]: Without dead ends: 72 [2019-02-18 09:29:04,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-18 09:29:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-18 09:29:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-02-18 09:29:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-18 09:29:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-18 09:29:04,313 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-02-18 09:29:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:04,313 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-18 09:29:04,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-18 09:29:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-18 09:29:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-18 09:29:04,314 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:04,314 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-02-18 09:29:04,314 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:04,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:04,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-02-18 09:29:04,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:04,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:04,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:04,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:04,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:06,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:06,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:06,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:06,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:06,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:06,066 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:29:06,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:29:06,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:29:06,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-18 09:29:06,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:06,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:06,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:11,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:11,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-18 09:29:11,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:11,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-18 09:29:11,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-18 09:29:11,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-18 09:29:11,827 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-02-18 09:29:12,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:12,013 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-18 09:29:12,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-18 09:29:12,013 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-02-18 09:29:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:12,014 INFO L225 Difference]: With dead ends: 75 [2019-02-18 09:29:12,014 INFO L226 Difference]: Without dead ends: 73 [2019-02-18 09:29:12,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-18 09:29:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-18 09:29:12,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-18 09:29:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-18 09:29:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-18 09:29:12,017 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-02-18 09:29:12,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:12,017 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-18 09:29:12,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-18 09:29:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-18 09:29:12,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-18 09:29:12,018 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:12,018 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-02-18 09:29:12,018 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:12,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:12,019 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-02-18 09:29:12,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:12,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:12,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:12,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:12,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:14,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:14,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:14,137 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:14,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:14,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:14,137 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:29:14,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:29:14,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:29:14,209 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:29:14,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:14,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:14,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:14,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:19,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:19,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-18 09:29:19,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:19,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-18 09:29:19,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-18 09:29:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-18 09:29:19,507 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-02-18 09:29:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:19,668 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-18 09:29:19,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-18 09:29:19,668 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-02-18 09:29:19,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:19,669 INFO L225 Difference]: With dead ends: 76 [2019-02-18 09:29:19,669 INFO L226 Difference]: Without dead ends: 74 [2019-02-18 09:29:19,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-18 09:29:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-18 09:29:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-02-18 09:29:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-18 09:29:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-02-18 09:29:19,673 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-02-18 09:29:19,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:19,673 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-02-18 09:29:19,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-18 09:29:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-02-18 09:29:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-02-18 09:29:19,674 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:19,674 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-02-18 09:29:19,674 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:19,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:19,675 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-02-18 09:29:19,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:19,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:19,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:19,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:19,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:22,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:22,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:22,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:22,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:22,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:22,255 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:29:22,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:22,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:29:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:22,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:22,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:27,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:27,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-18 09:29:27,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:27,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-18 09:29:27,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-18 09:29:27,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-18 09:29:27,759 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-02-18 09:29:27,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:27,916 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-02-18 09:29:27,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-18 09:29:27,916 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-02-18 09:29:27,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:27,917 INFO L225 Difference]: With dead ends: 77 [2019-02-18 09:29:27,917 INFO L226 Difference]: Without dead ends: 75 [2019-02-18 09:29:27,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-18 09:29:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-18 09:29:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-18 09:29:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-18 09:29:27,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-02-18 09:29:27,922 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-02-18 09:29:27,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:27,922 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-02-18 09:29:27,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-18 09:29:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-02-18 09:29:27,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-18 09:29:27,923 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:27,923 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-02-18 09:29:27,923 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:27,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:27,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-02-18 09:29:27,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:27,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:27,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:27,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:27,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:30,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:30,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:30,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:30,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:30,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:30,110 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:29:30,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:29:30,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:29:30,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-18 09:29:30,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:30,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:30,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:36,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:36,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-18 09:29:36,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:36,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-18 09:29:36,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-18 09:29:36,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-18 09:29:36,431 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-02-18 09:29:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:36,574 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-18 09:29:36,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-18 09:29:36,575 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-02-18 09:29:36,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:36,575 INFO L225 Difference]: With dead ends: 78 [2019-02-18 09:29:36,575 INFO L226 Difference]: Without dead ends: 76 [2019-02-18 09:29:36,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-18 09:29:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-18 09:29:36,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-02-18 09:29:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-18 09:29:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-18 09:29:36,579 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-02-18 09:29:36,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:36,579 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-18 09:29:36,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-18 09:29:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-18 09:29:36,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-18 09:29:36,580 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:36,580 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-02-18 09:29:36,580 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:36,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:36,580 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-02-18 09:29:36,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:36,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:36,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:36,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:36,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:38,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:38,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:38,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:38,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:38,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:38,531 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:29:38,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:29:38,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:29:38,604 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:29:38,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:38,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:38,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:44,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:44,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-18 09:29:44,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:44,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-18 09:29:44,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-18 09:29:44,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-18 09:29:44,759 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-02-18 09:29:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:44,902 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-02-18 09:29:44,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-18 09:29:44,903 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-02-18 09:29:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:44,903 INFO L225 Difference]: With dead ends: 79 [2019-02-18 09:29:44,903 INFO L226 Difference]: Without dead ends: 77 [2019-02-18 09:29:44,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-18 09:29:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-18 09:29:44,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-18 09:29:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-18 09:29:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-18 09:29:44,906 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-02-18 09:29:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:44,907 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-18 09:29:44,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-18 09:29:44,907 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-18 09:29:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-18 09:29:44,907 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:44,907 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-02-18 09:29:44,908 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:44,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:44,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-02-18 09:29:44,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:44,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:44,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:44,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:44,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:46,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:46,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:46,861 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:46,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:46,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:46,861 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:29:46,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:46,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:29:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:46,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:46,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:46,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:52,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:52,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:52,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-18 09:29:52,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:52,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-18 09:29:52,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-18 09:29:52,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-18 09:29:52,856 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-02-18 09:29:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:53,004 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-18 09:29:53,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-18 09:29:53,005 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-02-18 09:29:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:53,005 INFO L225 Difference]: With dead ends: 80 [2019-02-18 09:29:53,005 INFO L226 Difference]: Without dead ends: 78 [2019-02-18 09:29:53,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-18 09:29:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-18 09:29:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-02-18 09:29:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-18 09:29:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-02-18 09:29:53,008 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-02-18 09:29:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:53,009 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-02-18 09:29:53,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-18 09:29:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-02-18 09:29:53,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-02-18 09:29:53,009 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:53,010 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-02-18 09:29:53,010 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:53,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:53,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-02-18 09:29:53,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:53,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:53,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:53,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:53,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:55,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:55,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:55,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:55,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:55,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:55,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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:29:55,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:29:55,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:29:55,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-18 09:29:55,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:55,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:56,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:02,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:02,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-18 09:30:02,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:02,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-18 09:30:02,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-18 09:30:02,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-18 09:30:02,146 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-02-18 09:30:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:02,254 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-02-18 09:30:02,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-18 09:30:02,255 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-02-18 09:30:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:02,255 INFO L225 Difference]: With dead ends: 81 [2019-02-18 09:30:02,256 INFO L226 Difference]: Without dead ends: 79 [2019-02-18 09:30:02,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-18 09:30:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-18 09:30:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-18 09:30:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-18 09:30:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-02-18 09:30:02,260 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-02-18 09:30:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:02,260 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-02-18 09:30:02,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-18 09:30:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-02-18 09:30:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-18 09:30:02,261 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:02,261 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-02-18 09:30:02,261 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:02,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:02,262 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-02-18 09:30:02,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:02,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:02,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:02,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:02,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:04,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:04,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:04,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:04,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:04,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:04,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:04,308 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:30:04,317 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:30:04,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:30:04,384 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:30:04,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:04,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:04,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:10,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:10,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-18 09:30:10,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:10,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-18 09:30:10,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-18 09:30:10,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:30:10,985 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-02-18 09:30:11,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:11,114 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-02-18 09:30:11,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-18 09:30:11,114 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-02-18 09:30:11,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:11,115 INFO L225 Difference]: With dead ends: 82 [2019-02-18 09:30:11,115 INFO L226 Difference]: Without dead ends: 80 [2019-02-18 09:30:11,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:30:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-18 09:30:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-02-18 09:30:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-18 09:30:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-02-18 09:30:11,119 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-02-18 09:30:11,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:11,120 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-02-18 09:30:11,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-18 09:30:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-02-18 09:30:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-18 09:30:11,120 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:11,120 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-02-18 09:30:11,120 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:11,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:11,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-02-18 09:30:11,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:11,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:11,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:11,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:11,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:13,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:13,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:13,242 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:13,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:13,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:13,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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:30:13,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:13,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:30:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:13,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:13,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:19,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:19,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-18 09:30:19,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:19,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-18 09:30:19,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-18 09:30:19,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-18 09:30:19,704 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-02-18 09:30:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:19,880 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-02-18 09:30:19,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-18 09:30:19,880 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-02-18 09:30:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:19,881 INFO L225 Difference]: With dead ends: 83 [2019-02-18 09:30:19,881 INFO L226 Difference]: Without dead ends: 81 [2019-02-18 09:30:19,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-18 09:30:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-18 09:30:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-18 09:30:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-18 09:30:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-18 09:30:19,883 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-02-18 09:30:19,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:19,884 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-18 09:30:19,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-18 09:30:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-18 09:30:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-18 09:30:19,885 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:19,885 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-02-18 09:30:19,885 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:19,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:19,885 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-02-18 09:30:19,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:19,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:19,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:19,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:19,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:21,976 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-02-18 09:30:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:22,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:22,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:22,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:22,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:22,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:22,490 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:30:22,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:30:22,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:30:23,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-18 09:30:23,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:23,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:23,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:29,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:29,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-18 09:30:29,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:29,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-18 09:30:29,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-18 09:30:29,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 09:30:29,888 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-02-18 09:30:30,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:30,505 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-18 09:30:30,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-18 09:30:30,506 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-02-18 09:30:30,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:30,507 INFO L225 Difference]: With dead ends: 84 [2019-02-18 09:30:30,507 INFO L226 Difference]: Without dead ends: 82 [2019-02-18 09:30:30,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 09:30:30,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-18 09:30:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-02-18 09:30:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-18 09:30:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-18 09:30:30,510 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-02-18 09:30:30,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:30,511 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-18 09:30:30,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-18 09:30:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-18 09:30:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-18 09:30:30,511 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:30,511 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-02-18 09:30:30,512 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:30,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:30,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-02-18 09:30:30,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:30,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:30,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:30,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:30,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:32,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:32,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:32,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:32,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:32,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:32,800 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:30:32,808 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:30:32,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:30:32,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:30:32,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:32,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:32,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:39,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:39,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-18 09:30:39,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:39,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-18 09:30:39,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-18 09:30:39,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 09:30:39,589 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-02-18 09:30:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:39,749 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-02-18 09:30:39,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-18 09:30:39,750 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-02-18 09:30:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:39,750 INFO L225 Difference]: With dead ends: 85 [2019-02-18 09:30:39,750 INFO L226 Difference]: Without dead ends: 83 [2019-02-18 09:30:39,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 09:30:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-18 09:30:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-18 09:30:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-18 09:30:39,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-02-18 09:30:39,753 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-02-18 09:30:39,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:39,753 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-02-18 09:30:39,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-18 09:30:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-02-18 09:30:39,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-18 09:30:39,754 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:39,754 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-02-18 09:30:39,754 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:39,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:39,754 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-02-18 09:30:39,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:39,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:39,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:39,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:39,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:42,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:42,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:42,603 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:42,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:42,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:42,603 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:30:42,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:42,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:30:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:42,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:42,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:42,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:49,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:49,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-18 09:30:49,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:49,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-18 09:30:49,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-18 09:30:49,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-18 09:30:49,534 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-02-18 09:30:49,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:49,660 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-18 09:30:49,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-18 09:30:49,661 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-02-18 09:30:49,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:49,662 INFO L225 Difference]: With dead ends: 86 [2019-02-18 09:30:49,662 INFO L226 Difference]: Without dead ends: 84 [2019-02-18 09:30:49,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-18 09:30:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-18 09:30:49,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-02-18 09:30:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-18 09:30:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-02-18 09:30:49,666 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-02-18 09:30:49,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:49,666 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-02-18 09:30:49,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-18 09:30:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-02-18 09:30:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-18 09:30:49,666 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:49,666 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-02-18 09:30:49,666 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:49,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:49,667 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-02-18 09:30:49,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:49,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:49,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:49,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:49,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:52,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:52,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:52,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:52,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:52,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:52,355 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:30:52,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:30:52,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:30:53,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-18 09:30:53,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:53,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:53,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:00,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:00,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-18 09:31:00,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:00,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-18 09:31:00,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-18 09:31:00,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-18 09:31:00,586 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-02-18 09:31:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:00,775 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-18 09:31:00,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-18 09:31:00,775 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-02-18 09:31:00,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:00,776 INFO L225 Difference]: With dead ends: 87 [2019-02-18 09:31:00,776 INFO L226 Difference]: Without dead ends: 85 [2019-02-18 09:31:00,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-18 09:31:00,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-18 09:31:00,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-18 09:31:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-18 09:31:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-18 09:31:00,778 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-02-18 09:31:00,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:00,779 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-18 09:31:00,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-18 09:31:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-18 09:31:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-18 09:31:00,779 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:00,779 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-02-18 09:31:00,779 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:00,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:00,780 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-02-18 09:31:00,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:00,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:00,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:00,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:00,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:03,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:03,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:03,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:03,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:03,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:03,271 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:31:03,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:31:03,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:31:03,349 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:31:03,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:03,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:03,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:10,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:10,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-18 09:31:10,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:10,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-18 09:31:10,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-18 09:31:10,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 09:31:10,495 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-02-18 09:31:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:10,667 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-02-18 09:31:10,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-18 09:31:10,667 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-02-18 09:31:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:10,668 INFO L225 Difference]: With dead ends: 88 [2019-02-18 09:31:10,668 INFO L226 Difference]: Without dead ends: 86 [2019-02-18 09:31:10,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 09:31:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-18 09:31:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-02-18 09:31:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-18 09:31:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-18 09:31:10,671 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-02-18 09:31:10,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:10,671 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-18 09:31:10,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-18 09:31:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-18 09:31:10,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-18 09:31:10,671 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:10,671 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-02-18 09:31:10,672 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:10,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:10,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-02-18 09:31:10,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:10,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:10,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:10,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:10,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:13,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:13,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:13,352 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:13,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:13,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:13,352 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:31:13,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:31:13,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:31:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:13,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:13,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:20,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:20,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-18 09:31:20,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:20,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-18 09:31:20,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-18 09:31:20,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-18 09:31:20,593 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-02-18 09:31:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:20,736 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-02-18 09:31:20,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-18 09:31:20,736 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-02-18 09:31:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:20,736 INFO L225 Difference]: With dead ends: 89 [2019-02-18 09:31:20,737 INFO L226 Difference]: Without dead ends: 87 [2019-02-18 09:31:20,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-18 09:31:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-18 09:31:20,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-18 09:31:20,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-18 09:31:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-02-18 09:31:20,740 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-02-18 09:31:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:20,740 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-02-18 09:31:20,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-18 09:31:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-02-18 09:31:20,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-18 09:31:20,741 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:20,741 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-02-18 09:31:20,741 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:20,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:20,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-02-18 09:31:20,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:20,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:20,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:31:20,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:20,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:23,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:23,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:23,508 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:23,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:23,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:23,508 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:31:23,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:31:23,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:31:24,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-18 09:31:24,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:24,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:24,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:32,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:32,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-18 09:31:32,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:32,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-18 09:31:32,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-18 09:31:32,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-18 09:31:32,347 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-02-18 09:31:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:32,488 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-18 09:31:32,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-18 09:31:32,489 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-02-18 09:31:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:32,489 INFO L225 Difference]: With dead ends: 90 [2019-02-18 09:31:32,489 INFO L226 Difference]: Without dead ends: 88 [2019-02-18 09:31:32,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-18 09:31:32,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-02-18 09:31:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-02-18 09:31:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-18 09:31:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-18 09:31:32,492 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-02-18 09:31:32,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:32,492 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-18 09:31:32,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-18 09:31:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-18 09:31:32,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-18 09:31:32,493 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:32,493 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-02-18 09:31:32,493 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:32,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:32,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-02-18 09:31:32,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:32,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:32,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:32,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:32,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:35,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:35,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:35,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:35,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:35,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:35,035 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:31:35,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:31:35,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:31:35,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:31:35,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:35,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:35,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:43,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:43,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-18 09:31:43,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:43,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-18 09:31:43,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-18 09:31:43,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 09:31:43,051 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-02-18 09:31:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:43,219 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-18 09:31:43,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-18 09:31:43,220 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-02-18 09:31:43,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:43,220 INFO L225 Difference]: With dead ends: 91 [2019-02-18 09:31:43,220 INFO L226 Difference]: Without dead ends: 89 [2019-02-18 09:31:43,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 09:31:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-18 09:31:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-18 09:31:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-18 09:31:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-02-18 09:31:43,223 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-02-18 09:31:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:43,223 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-02-18 09:31:43,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-18 09:31:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-02-18 09:31:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-18 09:31:43,224 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:43,224 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-02-18 09:31:43,224 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:43,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:43,225 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-02-18 09:31:43,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:43,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:43,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:43,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:43,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:45,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:45,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:45,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:45,824 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:45,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:45,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:45,824 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:31:45,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:31:45,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:31:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:45,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:45,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:54,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:54,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-18 09:31:54,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:54,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-18 09:31:54,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-18 09:31:54,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 09:31:54,086 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-02-18 09:31:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:54,441 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-02-18 09:31:54,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-18 09:31:54,441 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-02-18 09:31:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:54,442 INFO L225 Difference]: With dead ends: 92 [2019-02-18 09:31:54,442 INFO L226 Difference]: Without dead ends: 90 [2019-02-18 09:31:54,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 09:31:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-18 09:31:54,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-02-18 09:31:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-18 09:31:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-02-18 09:31:54,445 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-02-18 09:31:54,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:54,445 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-02-18 09:31:54,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-18 09:31:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-02-18 09:31:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-02-18 09:31:54,446 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:54,446 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-02-18 09:31:54,446 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:54,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:54,447 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-02-18 09:31:54,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:54,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:54,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:31:54,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:54,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:57,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:57,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:57,094 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:57,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:57,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:57,095 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:31:57,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:31:57,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:31:58,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-18 09:31:58,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:58,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:58,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:06,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:06,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-18 09:32:06,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:06,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-18 09:32:06,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-18 09:32:06,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-18 09:32:06,251 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-02-18 09:32:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:06,483 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-02-18 09:32:06,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-18 09:32:06,484 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-02-18 09:32:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:06,484 INFO L225 Difference]: With dead ends: 93 [2019-02-18 09:32:06,484 INFO L226 Difference]: Without dead ends: 91 [2019-02-18 09:32:06,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-18 09:32:06,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-18 09:32:06,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-18 09:32:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-18 09:32:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-02-18 09:32:06,487 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-02-18 09:32:06,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:06,487 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-02-18 09:32:06,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-18 09:32:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-02-18 09:32:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-18 09:32:06,488 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:06,488 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-02-18 09:32:06,488 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:06,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:06,488 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-02-18 09:32:06,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:06,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:06,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:32:06,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:06,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:09,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:09,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:09,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:09,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:09,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:09,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:09,546 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:32:09,556 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:32:09,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:32:09,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:32:09,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:32:09,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:09,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:17,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:17,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-18 09:32:17,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:17,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-18 09:32:17,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-18 09:32:17,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 09:32:17,966 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-02-18 09:32:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:18,164 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-02-18 09:32:18,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-18 09:32:18,165 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-02-18 09:32:18,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:18,166 INFO L225 Difference]: With dead ends: 94 [2019-02-18 09:32:18,166 INFO L226 Difference]: Without dead ends: 92 [2019-02-18 09:32:18,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 09:32:18,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-18 09:32:18,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-02-18 09:32:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-18 09:32:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-18 09:32:18,169 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-02-18 09:32:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:18,169 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-18 09:32:18,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-18 09:32:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-18 09:32:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-18 09:32:18,169 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:18,169 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-02-18 09:32:18,169 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:18,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-02-18 09:32:18,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:18,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:18,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:32:18,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:18,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:20,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:20,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:20,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:20,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:20,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:20,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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:32:20,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:32:20,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:32:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:21,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:21,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:29,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:29,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-18 09:32:29,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:29,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-18 09:32:29,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-18 09:32:29,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-18 09:32:29,718 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-02-18 09:32:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:29,936 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-18 09:32:29,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-18 09:32:29,937 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-02-18 09:32:29,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:29,937 INFO L225 Difference]: With dead ends: 95 [2019-02-18 09:32:29,937 INFO L226 Difference]: Without dead ends: 93 [2019-02-18 09:32:29,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-18 09:32:29,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-18 09:32:29,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-18 09:32:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-18 09:32:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-02-18 09:32:29,941 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-02-18 09:32:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:29,941 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-02-18 09:32:29,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-18 09:32:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-02-18 09:32:29,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-18 09:32:29,941 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:29,942 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-02-18 09:32:29,942 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:29,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:29,942 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-02-18 09:32:29,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:29,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:29,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:32:29,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:29,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:32,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:32,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:32,793 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:32,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:32,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:32,793 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:32:32,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:32:32,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:32:34,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-18 09:32:34,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:32:34,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:34,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:43,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:43,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-18 09:32:43,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:43,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-18 09:32:43,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-18 09:32:43,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-18 09:32:43,039 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-02-18 09:32:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:43,179 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-18 09:32:43,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-18 09:32:43,180 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-02-18 09:32:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:43,181 INFO L225 Difference]: With dead ends: 96 [2019-02-18 09:32:43,181 INFO L226 Difference]: Without dead ends: 94 [2019-02-18 09:32:43,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-18 09:32:43,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-18 09:32:43,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-02-18 09:32:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-18 09:32:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-18 09:32:43,185 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-02-18 09:32:43,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:43,185 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-18 09:32:43,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-18 09:32:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-18 09:32:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-18 09:32:43,185 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:43,185 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-02-18 09:32:43,186 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:43,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:43,186 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-02-18 09:32:43,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:43,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:43,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:32:43,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:43,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:46,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:46,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:46,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:46,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:46,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:46,411 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:32:46,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:32:46,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:32:46,499 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:32:46,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:32:46,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:46,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:55,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:55,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-18 09:32:55,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:55,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-18 09:32:55,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-18 09:32:55,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 09:32:55,614 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-02-18 09:32:55,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:55,870 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-02-18 09:32:55,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-18 09:32:55,870 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-02-18 09:32:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:55,871 INFO L225 Difference]: With dead ends: 97 [2019-02-18 09:32:55,871 INFO L226 Difference]: Without dead ends: 95 [2019-02-18 09:32:55,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 09:32:55,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-18 09:32:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-18 09:32:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-18 09:32:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-02-18 09:32:55,875 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-02-18 09:32:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:55,875 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-02-18 09:32:55,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-18 09:32:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-02-18 09:32:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-18 09:32:55,876 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:55,876 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-02-18 09:32:55,876 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:55,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:55,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-02-18 09:32:55,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:55,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:55,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:32:55,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:55,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:59,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:59,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:59,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:59,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:59,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:59,311 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:32:59,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:32:59,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:32:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:59,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:59,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:08,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:08,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-18 09:33:08,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:08,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-18 09:33:08,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-18 09:33:08,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-18 09:33:08,227 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-02-18 09:33:08,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:08,430 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-02-18 09:33:08,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-18 09:33:08,431 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-02-18 09:33:08,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:08,431 INFO L225 Difference]: With dead ends: 98 [2019-02-18 09:33:08,431 INFO L226 Difference]: Without dead ends: 96 [2019-02-18 09:33:08,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-18 09:33:08,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-02-18 09:33:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-02-18 09:33:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-18 09:33:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-18 09:33:08,435 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-02-18 09:33:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:08,436 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-18 09:33:08,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-18 09:33:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-18 09:33:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-18 09:33:08,436 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:08,437 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-02-18 09:33:08,437 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:08,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:08,437 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-02-18 09:33:08,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:08,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:08,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:33:08,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:08,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:11,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:11,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:11,947 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:11,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:33:11,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:11,947 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:33:11,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:33:11,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:33:13,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-18 09:33:13,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:33:13,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:13,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:22,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:22,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-18 09:33:22,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:22,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-18 09:33:22,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-18 09:33:22,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-18 09:33:22,850 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-02-18 09:33:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:22,998 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-18 09:33:22,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-18 09:33:22,999 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-02-18 09:33:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:22,999 INFO L225 Difference]: With dead ends: 99 [2019-02-18 09:33:23,000 INFO L226 Difference]: Without dead ends: 97 [2019-02-18 09:33:23,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-18 09:33:23,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-18 09:33:23,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-18 09:33:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-18 09:33:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-18 09:33:23,003 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-02-18 09:33:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:23,003 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-18 09:33:23,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-18 09:33:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-18 09:33:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-18 09:33:23,004 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:23,004 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-02-18 09:33:23,004 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:23,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:23,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-02-18 09:33:23,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:23,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:23,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:33:23,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:23,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:26,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:26,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:26,362 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:26,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:33:26,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:26,362 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:33:26,370 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:33:26,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:33:26,454 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:33:26,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:33:26,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:26,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:36,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:36,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-18 09:33:36,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:36,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-18 09:33:36,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-18 09:33:36,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 09:33:36,031 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-02-18 09:33:36,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:36,181 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-18 09:33:36,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-18 09:33:36,181 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-02-18 09:33:36,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:36,182 INFO L225 Difference]: With dead ends: 100 [2019-02-18 09:33:36,182 INFO L226 Difference]: Without dead ends: 98 [2019-02-18 09:33:36,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 09:33:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-18 09:33:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-02-18 09:33:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-18 09:33:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-02-18 09:33:36,186 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-02-18 09:33:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:36,186 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-02-18 09:33:36,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-18 09:33:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-02-18 09:33:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-18 09:33:36,187 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:36,187 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-02-18 09:33:36,187 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:36,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:36,188 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-02-18 09:33:36,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:36,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:36,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:33:36,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:36,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:39,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:39,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:39,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:39,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:33:39,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:39,307 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:33:39,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:33:39,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:33:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:39,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:39,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:49,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:49,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-18 09:33:49,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:49,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-18 09:33:49,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-18 09:33:49,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-18 09:33:49,121 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-02-18 09:33:49,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:49,274 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-02-18 09:33:49,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-18 09:33:49,274 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-02-18 09:33:49,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:49,275 INFO L225 Difference]: With dead ends: 101 [2019-02-18 09:33:49,275 INFO L226 Difference]: Without dead ends: 99 [2019-02-18 09:33:49,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-18 09:33:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-18 09:33:49,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-18 09:33:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-18 09:33:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-02-18 09:33:49,279 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-02-18 09:33:49,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:49,279 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-02-18 09:33:49,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-18 09:33:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-02-18 09:33:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-18 09:33:49,280 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:49,280 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-02-18 09:33:49,280 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:49,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:49,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-02-18 09:33:49,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:49,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:49,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:33:49,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:49,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:52,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:52,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:52,700 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:52,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:33:52,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:52,700 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:33:52,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:33:52,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:33:54,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-18 09:33:54,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:33:54,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:54,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:04,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:04,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-18 09:34:04,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:04,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-18 09:34:04,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-18 09:34:04,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-18 09:34:04,307 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-02-18 09:34:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:04,470 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-18 09:34:04,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-18 09:34:04,471 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-02-18 09:34:04,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:04,471 INFO L225 Difference]: With dead ends: 102 [2019-02-18 09:34:04,471 INFO L226 Difference]: Without dead ends: 100 [2019-02-18 09:34:04,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-18 09:34:04,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-18 09:34:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-02-18 09:34:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-18 09:34:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-18 09:34:04,475 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-02-18 09:34:04,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:04,476 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-18 09:34:04,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-18 09:34:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-18 09:34:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-18 09:34:04,476 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:04,477 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-02-18 09:34:04,477 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:04,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:04,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-02-18 09:34:04,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:04,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:04,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:34:04,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:04,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:08,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:08,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:08,097 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:08,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:34:08,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:08,097 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:34:08,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:34:08,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:34:08,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:34:08,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:34:08,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:08,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:18,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:18,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-18 09:34:18,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:18,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-18 09:34:18,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-18 09:34:18,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 09:34:18,129 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-02-18 09:34:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:18,347 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-02-18 09:34:18,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-18 09:34:18,348 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-02-18 09:34:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:18,348 INFO L225 Difference]: With dead ends: 103 [2019-02-18 09:34:18,348 INFO L226 Difference]: Without dead ends: 101 [2019-02-18 09:34:18,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 09:34:18,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-18 09:34:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-18 09:34:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-18 09:34:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-18 09:34:18,353 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-02-18 09:34:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:18,353 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-18 09:34:18,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-18 09:34:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-18 09:34:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-18 09:34:18,354 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:18,354 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-02-18 09:34:18,354 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:18,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:18,354 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-02-18 09:34:18,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:18,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:34:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:18,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:21,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:21,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:21,910 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:21,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:34:21,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:21,910 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:34:21,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:34:21,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:34:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:22,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:22,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:32,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:32,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-18 09:34:32,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:32,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-18 09:34:32,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-18 09:34:32,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-18 09:34:32,068 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-02-18 09:34:32,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:32,360 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-02-18 09:34:32,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-18 09:34:32,360 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-02-18 09:34:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:32,361 INFO L225 Difference]: With dead ends: 104 [2019-02-18 09:34:32,361 INFO L226 Difference]: Without dead ends: 102 [2019-02-18 09:34:32,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-18 09:34:32,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-02-18 09:34:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-02-18 09:34:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-18 09:34:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-02-18 09:34:32,365 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-02-18 09:34:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:32,365 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-02-18 09:34:32,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-18 09:34:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-02-18 09:34:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-02-18 09:34:32,366 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:32,366 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-02-18 09:34:32,366 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:32,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:32,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-02-18 09:34:32,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:32,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:32,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:34:32,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:32,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:35,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:35,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:35,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:35,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:34:35,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:35,771 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:34:35,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:34:35,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:34:37,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-18 09:34:37,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:34:37,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:37,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:48,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:48,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-18 09:34:48,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:48,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-18 09:34:48,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-18 09:34:48,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-18 09:34:48,101 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-02-18 09:34:48,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:48,336 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-02-18 09:34:48,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-18 09:34:48,336 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-02-18 09:34:48,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:48,337 INFO L225 Difference]: With dead ends: 105 [2019-02-18 09:34:48,337 INFO L226 Difference]: Without dead ends: 103 [2019-02-18 09:34:48,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-18 09:34:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-18 09:34:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-18 09:34:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-18 09:34:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-02-18 09:34:48,341 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-02-18 09:34:48,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:48,341 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-02-18 09:34:48,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-18 09:34:48,341 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-02-18 09:34:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-18 09:34:48,341 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:48,342 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-02-18 09:34:48,342 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:48,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:48,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-02-18 09:34:48,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:48,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:48,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:34:48,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:48,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:52,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:52,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:52,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:52,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:34:52,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:52,092 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:34:52,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:34:52,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:34:52,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:34:52,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:34:52,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:52,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:35:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:02,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:35:02,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-18 09:35:02,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:35:02,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-18 09:35:02,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-18 09:35:02,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-18 09:35:02,779 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-02-18 09:35:03,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:03,046 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-02-18 09:35:03,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-18 09:35:03,046 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-02-18 09:35:03,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:03,047 INFO L225 Difference]: With dead ends: 106 [2019-02-18 09:35:03,047 INFO L226 Difference]: Without dead ends: 104 [2019-02-18 09:35:03,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-18 09:35:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-18 09:35:03,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-02-18 09:35:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-18 09:35:03,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-02-18 09:35:03,051 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-02-18 09:35:03,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:03,051 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-02-18 09:35:03,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-18 09:35:03,052 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-02-18 09:35:03,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-18 09:35:03,052 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:03,052 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-02-18 09:35:03,052 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:03,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:03,052 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-02-18 09:35:03,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:03,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:03,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:35:03,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:03,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:06,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:06,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:06,643 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:06,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:35:06,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:06,644 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:35:06,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:35:06,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:35:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:06,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:35:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:06,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:35:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:17,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:35:17,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-18 09:35:17,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:35:17,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-18 09:35:17,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-18 09:35:17,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-18 09:35:17,926 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-02-18 09:35:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:18,106 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-02-18 09:35:18,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-18 09:35:18,107 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-02-18 09:35:18,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:18,108 INFO L225 Difference]: With dead ends: 107 [2019-02-18 09:35:18,108 INFO L226 Difference]: Without dead ends: 105 [2019-02-18 09:35:18,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-18 09:35:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-18 09:35:18,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-18 09:35:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-18 09:35:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-02-18 09:35:18,113 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-02-18 09:35:18,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:18,113 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-02-18 09:35:18,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-18 09:35:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-02-18 09:35:18,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-18 09:35:18,114 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:18,114 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-02-18 09:35:18,114 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:18,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:18,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-02-18 09:35:18,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:18,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:35:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:18,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:21,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:21,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:21,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:21,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:35:21,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:21,714 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:35:21,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:35:21,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:35:23,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-18 09:35:23,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:35:23,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:35:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:23,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:35:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:35,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:35:35,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-18 09:35:35,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:35:35,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-18 09:35:35,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-18 09:35:35,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-18 09:35:35,151 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-02-18 09:35:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:35,486 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-18 09:35:35,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-18 09:35:35,486 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-02-18 09:35:35,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:35,487 INFO L225 Difference]: With dead ends: 108 [2019-02-18 09:35:35,487 INFO L226 Difference]: Without dead ends: 106 [2019-02-18 09:35:35,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-18 09:35:35,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-18 09:35:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-02-18 09:35:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-18 09:35:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-18 09:35:35,493 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-02-18 09:35:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:35,493 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-18 09:35:35,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-18 09:35:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-18 09:35:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-18 09:35:35,494 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:35,494 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-02-18 09:35:35,494 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:35,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:35,494 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-02-18 09:35:35,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:35,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:35,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:35:35,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:35,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:39,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:39,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:39,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:39,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:35:39,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:39,517 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:35:39,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:35:39,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:35:39,616 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:35:39,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:35:39,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:35:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:39,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:35:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:50,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:35:50,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-18 09:35:50,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:35:50,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-18 09:35:50,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-18 09:35:50,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-18 09:35:50,915 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-02-18 09:35:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:51,198 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-02-18 09:35:51,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-18 09:35:51,199 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-02-18 09:35:51,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:51,199 INFO L225 Difference]: With dead ends: 109 [2019-02-18 09:35:51,199 INFO L226 Difference]: Without dead ends: 107 [2019-02-18 09:35:51,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-18 09:35:51,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-18 09:35:51,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-18 09:35:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-18 09:35:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-02-18 09:35:51,204 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-02-18 09:35:51,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:51,204 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-02-18 09:35:51,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-18 09:35:51,204 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-02-18 09:35:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-18 09:35:51,205 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:51,205 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-02-18 09:35:51,205 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:51,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:51,205 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-02-18 09:35:51,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:51,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:51,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:35:51,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:51,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:55,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:55,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:55,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:55,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:35:55,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:55,329 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:35:55,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:35:55,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:35:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:55,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:35:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:55,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:07,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:07,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-18 09:36:07,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:07,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-18 09:36:07,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-18 09:36:07,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-18 09:36:07,128 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-02-18 09:36:07,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:07,380 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-18 09:36:07,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-18 09:36:07,380 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-02-18 09:36:07,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:07,381 INFO L225 Difference]: With dead ends: 110 [2019-02-18 09:36:07,381 INFO L226 Difference]: Without dead ends: 108 [2019-02-18 09:36:07,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-18 09:36:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-18 09:36:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-02-18 09:36:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-18 09:36:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-02-18 09:36:07,385 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-02-18 09:36:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:07,385 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-02-18 09:36:07,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-18 09:36:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-02-18 09:36:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-18 09:36:07,386 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:07,386 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-02-18 09:36:07,386 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:07,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:07,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-02-18 09:36:07,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:07,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:07,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:36:07,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:07,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:11,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:11,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:36:11,323 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:36:11,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:36:11,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:11,323 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:36:11,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:36:11,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:36:13,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-18 09:36:13,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:36:13,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:36:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:13,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:25,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:25,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-02-18 09:36:25,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:25,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-18 09:36:25,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-18 09:36:25,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-18 09:36:25,304 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-02-18 09:36:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:25,545 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-18 09:36:25,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-18 09:36:25,545 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-02-18 09:36:25,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:25,546 INFO L225 Difference]: With dead ends: 111 [2019-02-18 09:36:25,546 INFO L226 Difference]: Without dead ends: 109 [2019-02-18 09:36:25,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-18 09:36:25,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-18 09:36:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-18 09:36:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-18 09:36:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-18 09:36:25,550 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-02-18 09:36:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:25,551 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-18 09:36:25,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-18 09:36:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-18 09:36:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-18 09:36:25,551 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:25,552 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-02-18 09:36:25,552 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:25,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:25,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-02-18 09:36:25,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:25,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:25,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:36:25,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:25,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:29,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:29,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:36:29,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:36:29,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:36:29,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:29,624 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:36:29,631 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:36:29,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:36:29,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:36:29,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:36:29,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:36:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:29,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:41,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:41,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-02-18 09:36:41,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:41,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-18 09:36:41,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-18 09:36:41,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-02-18 09:36:41,508 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-02-18 09:36:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:41,753 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-02-18 09:36:41,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-02-18 09:36:41,753 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-02-18 09:36:41,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:41,754 INFO L225 Difference]: With dead ends: 112 [2019-02-18 09:36:41,754 INFO L226 Difference]: Without dead ends: 110 [2019-02-18 09:36:41,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-02-18 09:36:41,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-18 09:36:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-02-18 09:36:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-02-18 09:36:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-02-18 09:36:41,758 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-02-18 09:36:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:41,758 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-02-18 09:36:41,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-18 09:36:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-02-18 09:36:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-02-18 09:36:41,759 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:41,759 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-02-18 09:36:41,759 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:41,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:41,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-02-18 09:36:41,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:41,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:41,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:36:41,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:41,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:45,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:45,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:36:45,980 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:36:45,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:36:45,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:45,981 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:36:45,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:36:45,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:36:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:46,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:36:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:46,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:58,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:58,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-02-18 09:36:58,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:58,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-02-18 09:36:58,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-02-18 09:36:58,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-18 09:36:58,290 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-02-18 09:36:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:58,573 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-02-18 09:36:58,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-02-18 09:36:58,573 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-02-18 09:36:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:58,573 INFO L225 Difference]: With dead ends: 113 [2019-02-18 09:36:58,573 INFO L226 Difference]: Without dead ends: 111 [2019-02-18 09:36:58,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-18 09:36:58,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-18 09:36:58,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-18 09:36:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-18 09:36:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-02-18 09:36:58,577 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-02-18 09:36:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:58,578 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-02-18 09:36:58,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-02-18 09:36:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-02-18 09:36:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-18 09:36:58,579 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:58,579 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-02-18 09:36:58,579 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:58,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:58,579 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-02-18 09:36:58,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:58,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:58,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:36:58,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:58,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:02,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:02,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:02,857 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:37:02,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:37:02,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:02,857 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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:37:02,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:37:02,865 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:37:05,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-02-18 09:37:05,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:37:05,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:05,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:18,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:18,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-02-18 09:37:18,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:18,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-18 09:37:18,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-18 09:37:18,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-18 09:37:18,259 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-02-18 09:37:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:18,581 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-18 09:37:18,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-02-18 09:37:18,581 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-02-18 09:37:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:18,582 INFO L225 Difference]: With dead ends: 114 [2019-02-18 09:37:18,582 INFO L226 Difference]: Without dead ends: 112 [2019-02-18 09:37:18,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-18 09:37:18,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-18 09:37:18,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-02-18 09:37:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-18 09:37:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-18 09:37:18,586 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-02-18 09:37:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:18,586 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-18 09:37:18,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-18 09:37:18,586 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-18 09:37:18,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-18 09:37:18,587 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:18,587 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-02-18 09:37:18,587 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:18,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:18,587 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-02-18 09:37:18,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:18,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:18,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:37:18,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:18,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:23,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:23,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:23,070 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:37:23,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:37:23,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:23,070 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 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:37:23,078 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:37:23,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:37:23,172 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:37:23,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:37:23,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:23,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:36,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:36,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-02-18 09:37:36,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:36,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-18 09:37:36,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-18 09:37:36,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-18 09:37:36,064 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-02-18 09:37:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:36,331 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-18 09:37:36,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-18 09:37:36,336 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-02-18 09:37:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:36,337 INFO L225 Difference]: With dead ends: 115 [2019-02-18 09:37:36,337 INFO L226 Difference]: Without dead ends: 113 [2019-02-18 09:37:36,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-18 09:37:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-18 09:37:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-18 09:37:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-18 09:37:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-02-18 09:37:36,341 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-02-18 09:37:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:36,341 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-02-18 09:37:36,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-18 09:37:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-02-18 09:37:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-18 09:37:36,342 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:36,342 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-02-18 09:37:36,342 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:36,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:36,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-02-18 09:37:36,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:36,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:36,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:37:36,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:36,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:40,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:40,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:40,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:37:40,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:37:40,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37: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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:37:40,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:40,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:41,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:41,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:41,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:53,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:53,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-02-18 09:37:53,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:53,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-18 09:37:53,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-18 09:37:53,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-18 09:37:53,888 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-02-18 09:37:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:54,108 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-02-18 09:37:54,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-02-18 09:37:54,109 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-02-18 09:37:54,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:54,109 INFO L225 Difference]: With dead ends: 116 [2019-02-18 09:37:54,109 INFO L226 Difference]: Without dead ends: 114 [2019-02-18 09:37:54,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-18 09:37:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-18 09:37:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-02-18 09:37:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-18 09:37:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-02-18 09:37:54,113 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-02-18 09:37:54,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:54,114 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-02-18 09:37:54,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-18 09:37:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-02-18 09:37:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-02-18 09:37:54,114 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:54,115 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-02-18 09:37:54,115 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:54,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:54,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-02-18 09:37:54,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:54,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:54,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:54,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:54,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:58,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:58,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:58,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:58,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:37:58,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:37:58,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:58,650 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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:37:58,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:37:58,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:01,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-02-18 09:38:01,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:01,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:01,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:14,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:14,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2019-02-18 09:38:14,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:14,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-18 09:38:14,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-18 09:38:14,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-02-18 09:38:14,574 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-02-18 09:38:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:14,974 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-02-18 09:38:14,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-02-18 09:38:14,974 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-02-18 09:38:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:14,975 INFO L225 Difference]: With dead ends: 117 [2019-02-18 09:38:14,975 INFO L226 Difference]: Without dead ends: 115 [2019-02-18 09:38:14,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-02-18 09:38:14,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-18 09:38:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-02-18 09:38:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-18 09:38:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-02-18 09:38:14,979 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-02-18 09:38:14,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:14,980 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-02-18 09:38:14,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-18 09:38:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-02-18 09:38:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-18 09:38:14,980 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:14,980 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-02-18 09:38:14,981 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:14,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-02-18 09:38:14,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:14,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:14,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:14,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:19,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:19,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:19,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:19,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:19,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:19,739 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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:19,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:38:19,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:38:19,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:38:19,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:19,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:19,870 INFO L316 TraceCheckSpWp]: Computing backward predicates...