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/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:20:41,601 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:20:41,603 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:20:41,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:20:41,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:20:41,616 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:20:41,617 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:20:41,619 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:20:41,621 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:20:41,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:20:41,622 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:20:41,622 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:20:41,623 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:20:41,624 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:20:41,625 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:20:41,626 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:20:41,627 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:20:41,629 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:20:41,631 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:20:41,633 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:20:41,634 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:20:41,635 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:20:41,637 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:20:41,638 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:20:41,638 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:20:41,639 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:20:41,640 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:20:41,641 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:20:41,642 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:20:41,643 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:20:41,643 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:20:41,644 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:20:41,644 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:20:41,644 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:20:41,645 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:20:41,646 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:20:41,646 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:20:41,659 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:20:41,659 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:20:41,660 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:20:41,660 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:20:41,660 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:20:41,660 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:20:41,661 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:20:41,661 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:20:41,661 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:20:41,661 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:20:41,661 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:20:41,662 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:20:41,662 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:20:41,662 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:20:41,662 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:20:41,663 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:20:41,663 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:20:41,663 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:20:41,663 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:20:41,664 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:20:41,664 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:20:41,664 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:20:41,664 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:20:41,664 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:20:41,665 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:20:41,665 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:20:41,665 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:20:41,665 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:20:41,665 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:20:41,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:20:41,666 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:20:41,666 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:20:41,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:20:41,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:20:41,667 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:20:41,667 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:20:41,667 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:20:41,667 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:20:41,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:20:41,667 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:20:41,668 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:20:41,697 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:20:41,715 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:20:41,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:20:41,721 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:20:41,721 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:20:41,722 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-12-03 15:20:41,723 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl' [2018-12-03 15:20:41,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:20:41,767 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:20:41,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:20:41,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:20:41,769 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:20:41,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:20:41" (1/1) ... [2018-12-03 15:20:41,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:20:41" (1/1) ... [2018-12-03 15:20:41,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:20:41,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:20:41,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:20:41,807 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:20:41,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:20:41" (1/1) ... [2018-12-03 15:20:41,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:20:41" (1/1) ... [2018-12-03 15:20:41,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:20:41" (1/1) ... [2018-12-03 15:20:41,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:20:41" (1/1) ... [2018-12-03 15:20:41,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:20:41" (1/1) ... [2018-12-03 15:20:41,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:20:41" (1/1) ... [2018-12-03 15:20:41,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:20:41" (1/1) ... [2018-12-03 15:20:41,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:20:41,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:20:41,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:20:41,831 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:20:41,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:20:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:20:41,906 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 15:20:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:20:41,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:20:42,173 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:20:42,174 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:20:42,174 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:20:42 BoogieIcfgContainer [2018-12-03 15:20:42,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:20:42,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:20:42,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:20:42,179 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:20:42,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:20:41" (1/2) ... [2018-12-03 15:20:42,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b7eb71 and model type fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:20:42, skipping insertion in model container [2018-12-03 15:20:42,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:20:42" (2/2) ... [2018-12-03 15:20:42,182 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-12-03 15:20:42,193 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:20:42,204 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:20:42,225 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:20:42,271 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:20:42,271 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:20:42,271 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:20:42,271 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:20:42,272 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:20:42,272 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:20:42,272 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:20:42,272 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:20:42,293 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-12-03 15:20:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:20:42,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:42,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:20:42,310 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:42,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:42,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1807861163, now seen corresponding path program 1 times [2018-12-03 15:20:42,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:42,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:42,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:42,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:42,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:20:42,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:20:42,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:20:42,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:20:42,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:20:42,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:20:42,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:20:42,516 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-12-03 15:20:42,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:42,599 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-12-03 15:20:42,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:20:42,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-03 15:20:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:42,613 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:20:42,613 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:20:42,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:20:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:20:42,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:20:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:20:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-03 15:20:42,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2018-12-03 15:20:42,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:42,656 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-03 15:20:42,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:20:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-03 15:20:42,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:20:42,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:42,657 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:20:42,658 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:42,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:42,658 INFO L82 PathProgramCache]: Analyzing trace with hash 89245487, now seen corresponding path program 1 times [2018-12-03 15:20:42,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:42,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:42,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:42,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:42,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:20:42,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:42,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:42,755 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-03 15:20:42,756 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [13], [17], [23], [25] [2018-12-03 15:20:42,796 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:20:42,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:20:43,072 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:20:43,076 INFO L272 AbstractInterpreter]: Visited 8 different actions 21 times. Merged at 7 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:20:43,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:43,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:20:43,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:43,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:43,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:43,142 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:20:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:43,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:20:43,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:20:43,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:43,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:20:43,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:43,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:20:43,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:20:43,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:20:43,336 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 4 states. [2018-12-03 15:20:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:43,387 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-03 15:20:43,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:20:43,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-12-03 15:20:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:43,389 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:20:43,389 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:20:43,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:20:43,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:20:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:20:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:20:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 15:20:43,394 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-12-03 15:20:43,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:43,394 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 15:20:43,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:20:43,394 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 15:20:43,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:20:43,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:43,395 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:20:43,396 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:43,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:43,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2061989811, now seen corresponding path program 2 times [2018-12-03 15:20:43,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:43,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:43,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:43,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:20:43,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:20:43,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:20:43,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:20:43,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:20:43,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:20:43,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:20:43,530 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2018-12-03 15:20:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:43,636 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-12-03 15:20:43,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:20:43,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-03 15:20:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:43,638 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:20:43,641 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:20:43,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:20:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:20:43,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 15:20:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:20:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-12-03 15:20:43,652 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2018-12-03 15:20:43,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:43,652 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-03 15:20:43,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:20:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-12-03 15:20:43,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:20:43,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:43,655 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:20:43,655 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:43,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:43,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2062049393, now seen corresponding path program 1 times [2018-12-03 15:20:43,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:43,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:43,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:20:43,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:43,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:20:43,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:20:43,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:20:43,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:20:43,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:20:43,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:20:43,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:20:43,735 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 4 states. [2018-12-03 15:20:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:43,881 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-12-03 15:20:43,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:20:43,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-03 15:20:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:43,883 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:20:43,883 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:20:43,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:20:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:20:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-12-03 15:20:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:20:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-03 15:20:43,891 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 11 [2018-12-03 15:20:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:43,891 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-03 15:20:43,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:20:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-03 15:20:43,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:20:43,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:43,893 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-12-03 15:20:43,893 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:43,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:43,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1980186676, now seen corresponding path program 1 times [2018-12-03 15:20:43,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:43,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:43,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:43,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:43,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:44,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:44,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:44,034 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:20:44,034 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [13], [15], [17], [21], [23], [25] [2018-12-03 15:20:44,036 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:20:44,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:20:44,220 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:20:44,220 INFO L272 AbstractInterpreter]: Visited 10 different actions 50 times. Merged at 9 different actions 31 times. Widened at 4 different actions 5 times. Found 9 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 15:20:44,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:44,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:20:44,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:44,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:44,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:44,281 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:20:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:44,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:44,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:44,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:44,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 15:20:44,437 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:44,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:20:44,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:20:44,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:20:44,439 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-12-03 15:20:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:44,470 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-12-03 15:20:44,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:20:44,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-03 15:20:44,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:44,471 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:20:44,471 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:20:44,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:20:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:20:44,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 15:20:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 15:20:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-12-03 15:20:44,480 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-12-03 15:20:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:44,481 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-12-03 15:20:44,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:20:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-12-03 15:20:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:20:44,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:44,483 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:44,483 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:44,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:44,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1317950664, now seen corresponding path program 2 times [2018-12-03 15:20:44,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:44,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:44,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:44,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:44,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:44,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:44,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:44,681 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:44,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:44,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:44,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:44,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:20:44,694 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:20:44,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:20:44,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:20:44,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:44,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:44,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:44,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:20:44,947 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:44,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:20:44,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:20:44,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:20:44,949 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2018-12-03 15:20:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:45,079 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-12-03 15:20:45,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:20:45,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-03 15:20:45,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:45,081 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:20:45,081 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:20:45,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:20:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:20:45,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 15:20:45,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:20:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-03 15:20:45,087 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2018-12-03 15:20:45,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:45,088 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-03 15:20:45,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:20:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-03 15:20:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:20:45,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:45,089 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:45,089 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:45,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:45,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1142069956, now seen corresponding path program 3 times [2018-12-03 15:20:45,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:45,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:45,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:20:45,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:45,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:45,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:45,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:45,190 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:45,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:45,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:45,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:45,207 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:20:45,207 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:20:45,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:20:45,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:20:45,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:45,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:45,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:45,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:20:45,779 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:45,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:20:45,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:20:45,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:20:45,780 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 7 states. [2018-12-03 15:20:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:45,834 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-12-03 15:20:45,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:20:45,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-03 15:20:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:45,835 INFO L225 Difference]: With dead ends: 41 [2018-12-03 15:20:45,835 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:20:45,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:20:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:20:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 15:20:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:20:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-12-03 15:20:45,841 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2018-12-03 15:20:45,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:45,842 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-12-03 15:20:45,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:20:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-12-03 15:20:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:20:45,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:45,843 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:45,843 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:45,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:45,844 INFO L82 PathProgramCache]: Analyzing trace with hash -375565888, now seen corresponding path program 4 times [2018-12-03 15:20:45,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:45,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:45,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:20:45,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:45,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:45,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:45,970 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:45,970 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:45,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:45,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:45,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:45,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:45,979 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:20:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:46,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:46,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:46,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:46,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:20:46,203 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:46,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:20:46,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:20:46,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:20:46,204 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 8 states. [2018-12-03 15:20:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:46,264 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-03 15:20:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:20:46,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-03 15:20:46,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:46,267 INFO L225 Difference]: With dead ends: 43 [2018-12-03 15:20:46,267 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:20:46,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:20:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:20:46,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 15:20:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:20:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-12-03 15:20:46,274 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 26 [2018-12-03 15:20:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:46,275 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-12-03 15:20:46,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:20:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-12-03 15:20:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:20:46,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:46,276 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:46,276 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:46,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:46,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1465268668, now seen corresponding path program 5 times [2018-12-03 15:20:46,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:46,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:46,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:46,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:46,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:46,402 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:46,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:46,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:46,403 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:46,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:46,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:46,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:46,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:20:46,416 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:20:46,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:20:46,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:20:46,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:46,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:46,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:46,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:20:46,710 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:46,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:20:46,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:20:46,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:20:46,711 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 9 states. [2018-12-03 15:20:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:46,752 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-12-03 15:20:46,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:20:46,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-12-03 15:20:46,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:46,754 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:20:46,754 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:20:46,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:20:46,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:20:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:20:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:20:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-12-03 15:20:46,760 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 28 [2018-12-03 15:20:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:46,761 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-03 15:20:46,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:20:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-12-03 15:20:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:20:46,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:46,762 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:46,762 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:46,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:46,763 INFO L82 PathProgramCache]: Analyzing trace with hash 980751032, now seen corresponding path program 6 times [2018-12-03 15:20:46,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:46,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:46,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:20:46,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:46,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:46,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:46,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:46,872 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:46,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:46,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:46,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:46,882 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:20:46,882 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:20:46,919 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:20:46,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:20:46,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:46,928 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:46,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:47,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:47,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:20:47,393 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:47,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:20:47,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:20:47,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:20:47,395 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 10 states. [2018-12-03 15:20:47,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:47,450 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-12-03 15:20:47,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:20:47,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-12-03 15:20:47,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:47,451 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:20:47,451 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:20:47,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:20:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:20:47,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 15:20:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:20:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-12-03 15:20:47,467 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2018-12-03 15:20:47,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:47,467 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-12-03 15:20:47,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:20:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-12-03 15:20:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:20:47,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:47,468 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:47,470 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:47,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:47,471 INFO L82 PathProgramCache]: Analyzing trace with hash -784229196, now seen corresponding path program 7 times [2018-12-03 15:20:47,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:47,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:47,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:20:47,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:47,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:47,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:47,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:47,727 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:47,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:47,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:47,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:47,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:47,735 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:20:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:47,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:47,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:47,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:47,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:20:47,978 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:47,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:20:47,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:20:47,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:20:47,979 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 11 states. [2018-12-03 15:20:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:48,042 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-03 15:20:48,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:20:48,046 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-12-03 15:20:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:48,047 INFO L225 Difference]: With dead ends: 49 [2018-12-03 15:20:48,047 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:20:48,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:20:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:20:48,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 15:20:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:20:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-12-03 15:20:48,055 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 32 [2018-12-03 15:20:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:48,055 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-12-03 15:20:48,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:20:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-12-03 15:20:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:20:48,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:48,056 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:48,057 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:48,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:48,057 INFO L82 PathProgramCache]: Analyzing trace with hash -418146384, now seen corresponding path program 8 times [2018-12-03 15:20:48,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:48,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:48,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:48,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:48,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:48,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:48,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:48,344 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:48,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:48,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:48,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:48,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:20:48,360 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:20:48,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:20:48,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:20:48,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:48,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:48,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:48,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 15:20:48,737 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:48,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:20:48,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:20:48,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:20:48,738 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 12 states. [2018-12-03 15:20:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:48,805 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-12-03 15:20:48,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:20:48,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-12-03 15:20:48,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:48,807 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:20:48,807 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:20:48,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:20:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:20:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 15:20:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 15:20:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-12-03 15:20:48,820 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2018-12-03 15:20:48,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:48,821 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-12-03 15:20:48,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:20:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-12-03 15:20:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 15:20:48,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:48,822 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:48,822 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:48,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash -799882324, now seen corresponding path program 9 times [2018-12-03 15:20:48,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:48,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:48,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:20:48,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:48,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:49,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:49,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:49,169 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:49,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:49,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:49,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:49,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:20:49,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:20:49,217 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:20:49,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:20:49,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:49,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:49,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:49,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 15:20:49,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:49,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:20:49,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:20:49,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:20:49,720 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 13 states. [2018-12-03 15:20:49,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:49,755 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-12-03 15:20:49,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:20:49,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-12-03 15:20:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:49,756 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:20:49,757 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 15:20:49,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:20:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 15:20:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 15:20:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 15:20:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-12-03 15:20:49,764 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 36 [2018-12-03 15:20:49,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:49,765 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-12-03 15:20:49,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:20:49,765 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-12-03 15:20:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:20:49,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:49,766 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:49,766 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:49,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:49,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1719066792, now seen corresponding path program 10 times [2018-12-03 15:20:49,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:49,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:49,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:20:49,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:49,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:49,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:49,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:49,929 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:49,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:49,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:49,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:49,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:49,938 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:20:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:49,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:49,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:50,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:50,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 15:20:50,746 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:50,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:20:50,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:20:50,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:20:50,749 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 14 states. [2018-12-03 15:20:50,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:50,789 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-12-03 15:20:50,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:20:50,790 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-12-03 15:20:50,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:50,791 INFO L225 Difference]: With dead ends: 55 [2018-12-03 15:20:50,791 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 15:20:50,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:20:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 15:20:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 15:20:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 15:20:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-12-03 15:20:50,797 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 38 [2018-12-03 15:20:50,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:50,798 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-12-03 15:20:50,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:20:50,798 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-12-03 15:20:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 15:20:50,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:50,799 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:50,799 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:50,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:50,799 INFO L82 PathProgramCache]: Analyzing trace with hash 67612324, now seen corresponding path program 11 times [2018-12-03 15:20:50,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:50,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:50,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:50,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:50,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:50,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:50,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:50,973 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:50,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:50,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:50,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:50,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:20:50,988 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:20:51,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:20:51,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:20:51,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:51,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:51,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:51,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 15:20:51,501 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:51,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:20:51,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:20:51,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:20:51,503 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 15 states. [2018-12-03 15:20:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:51,576 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-12-03 15:20:51,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:20:51,579 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-12-03 15:20:51,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:51,580 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:20:51,580 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:20:51,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:20:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:20:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 15:20:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 15:20:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-12-03 15:20:51,587 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 40 [2018-12-03 15:20:51,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:51,587 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-12-03 15:20:51,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:20:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-12-03 15:20:51,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:20:51,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:51,588 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:51,588 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:51,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:51,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2137199200, now seen corresponding path program 12 times [2018-12-03 15:20:51,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:51,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:51,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:20:51,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:51,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:51,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:51,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:51,761 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:51,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:51,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:51,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:51,772 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:20:51,772 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:20:51,797 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:20:51,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:20:51,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:51,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:52,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:52,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 15:20:52,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:52,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:20:52,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:20:52,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:20:52,184 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 16 states. [2018-12-03 15:20:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:52,217 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-12-03 15:20:52,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:20:52,218 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-12-03 15:20:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:52,219 INFO L225 Difference]: With dead ends: 59 [2018-12-03 15:20:52,219 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 15:20:52,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:20:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 15:20:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 15:20:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 15:20:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-12-03 15:20:52,224 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 42 [2018-12-03 15:20:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:52,224 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-12-03 15:20:52,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:20:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-12-03 15:20:52,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:20:52,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:52,225 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:52,226 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:52,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:52,226 INFO L82 PathProgramCache]: Analyzing trace with hash 752770460, now seen corresponding path program 13 times [2018-12-03 15:20:52,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:52,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:20:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:52,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:53,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:53,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:53,002 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:53,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:53,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:53,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:53,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:53,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:20:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:53,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:53,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:53,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:53,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 15:20:53,674 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:53,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:20:53,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:20:53,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:20:53,676 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 17 states. [2018-12-03 15:20:53,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:53,706 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-12-03 15:20:53,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:20:53,707 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-12-03 15:20:53,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:53,707 INFO L225 Difference]: With dead ends: 61 [2018-12-03 15:20:53,708 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 15:20:53,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:20:53,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 15:20:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 15:20:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 15:20:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-12-03 15:20:53,714 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 44 [2018-12-03 15:20:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:53,714 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-12-03 15:20:53,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:20:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-12-03 15:20:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 15:20:53,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:53,715 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:53,716 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:53,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:53,716 INFO L82 PathProgramCache]: Analyzing trace with hash -830226792, now seen corresponding path program 14 times [2018-12-03 15:20:53,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:53,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:53,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:53,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:53,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:54,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:54,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:54,003 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:54,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:54,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:54,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:54,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:20:54,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:20:54,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:20:54,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:20:54,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:54,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:54,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:54,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 15:20:54,496 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:54,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:20:54,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:20:54,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:20:54,497 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 18 states. [2018-12-03 15:20:54,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:54,585 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-12-03 15:20:54,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:20:54,586 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-12-03 15:20:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:54,587 INFO L225 Difference]: With dead ends: 63 [2018-12-03 15:20:54,587 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:20:54,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:20:54,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:20:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 15:20:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 15:20:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-12-03 15:20:54,597 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 46 [2018-12-03 15:20:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:54,597 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-12-03 15:20:54,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:20:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-12-03 15:20:54,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:20:54,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:54,598 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:54,598 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:54,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:54,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1672163180, now seen corresponding path program 15 times [2018-12-03 15:20:54,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:54,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:54,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:20:54,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:54,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:55,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:55,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:55,280 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:55,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:55,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:55,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:55,289 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:20:55,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:20:55,317 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:20:55,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:20:55,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:55,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:56,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:56,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 15:20:56,217 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:56,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:20:56,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:20:56,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:20:56,219 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 19 states. [2018-12-03 15:20:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:56,270 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-12-03 15:20:56,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:20:56,270 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-12-03 15:20:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:56,271 INFO L225 Difference]: With dead ends: 65 [2018-12-03 15:20:56,271 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 15:20:56,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:20:56,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 15:20:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 15:20:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:20:56,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-12-03 15:20:56,276 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 48 [2018-12-03 15:20:56,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:56,277 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-12-03 15:20:56,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:20:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-12-03 15:20:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:20:56,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:56,278 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:56,278 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:56,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:56,278 INFO L82 PathProgramCache]: Analyzing trace with hash 975786896, now seen corresponding path program 16 times [2018-12-03 15:20:56,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:56,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:56,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:20:56,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:56,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:56,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:56,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:56,564 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:56,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:56,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:56,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:56,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:56,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:20:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:56,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:56,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:57,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:57,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 15:20:57,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:57,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:20:57,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:20:57,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:20:57,643 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 20 states. [2018-12-03 15:20:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:57,683 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-12-03 15:20:57,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:20:57,684 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2018-12-03 15:20:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:57,685 INFO L225 Difference]: With dead ends: 67 [2018-12-03 15:20:57,685 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 15:20:57,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:20:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 15:20:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 15:20:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 15:20:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-12-03 15:20:57,693 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 50 [2018-12-03 15:20:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:57,693 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-12-03 15:20:57,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:20:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-12-03 15:20:57,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 15:20:57,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:57,694 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:57,695 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:57,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:57,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1259796596, now seen corresponding path program 17 times [2018-12-03 15:20:57,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:57,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:57,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:57,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:57,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:58,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:58,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:58,903 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:58,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:58,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:58,904 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:58,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:20:58,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:20:58,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 15:20:58,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:20:58,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:58,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:59,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:59,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 15:20:59,468 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:59,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:20:59,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:20:59,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:20:59,469 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 21 states. [2018-12-03 15:20:59,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:59,500 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-03 15:20:59,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:20:59,501 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-12-03 15:20:59,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:59,501 INFO L225 Difference]: With dead ends: 69 [2018-12-03 15:20:59,501 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 15:20:59,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:20:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 15:20:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 15:20:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 15:20:59,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-12-03 15:20:59,507 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 52 [2018-12-03 15:20:59,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:59,508 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-12-03 15:20:59,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:20:59,508 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-12-03 15:20:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:20:59,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:59,509 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:20:59,509 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:59,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:59,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2123082888, now seen corresponding path program 18 times [2018-12-03 15:20:59,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:59,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:59,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:20:59,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:59,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:59,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:59,806 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:59,806 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:59,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:59,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:59,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:59,816 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:20:59,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:20:59,852 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:20:59,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:20:59,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:20:59,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:00,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:00,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 15:21:00,474 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:00,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:21:00,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:21:00,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:21:00,475 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 22 states. [2018-12-03 15:21:00,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:00,628 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-12-03 15:21:00,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:21:00,631 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-12-03 15:21:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:00,632 INFO L225 Difference]: With dead ends: 71 [2018-12-03 15:21:00,632 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:21:00,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:21:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:21:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 15:21:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 15:21:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-12-03 15:21:00,638 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 54 [2018-12-03 15:21:00,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:00,638 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-12-03 15:21:00,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:21:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-12-03 15:21:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 15:21:00,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:00,639 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:00,639 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:00,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:00,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1780023940, now seen corresponding path program 19 times [2018-12-03 15:21:00,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:00,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:00,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:00,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:00,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:00,906 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:00,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:00,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:00,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:00,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:00,915 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:00,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:00,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:01,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:01,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 15:21:01,473 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:01,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:21:01,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:21:01,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:21:01,474 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 23 states. [2018-12-03 15:21:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:01,553 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-12-03 15:21:01,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:21:01,554 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-12-03 15:21:01,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:01,554 INFO L225 Difference]: With dead ends: 73 [2018-12-03 15:21:01,555 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 15:21:01,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:21:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 15:21:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 15:21:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:21:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-12-03 15:21:01,560 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 56 [2018-12-03 15:21:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:01,560 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-12-03 15:21:01,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:21:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-12-03 15:21:01,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 15:21:01,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:01,561 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:01,561 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:01,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:01,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1482110592, now seen corresponding path program 20 times [2018-12-03 15:21:01,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:01,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:01,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:01,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:01,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:01,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:01,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:01,854 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:01,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:01,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:01,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:01,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:01,864 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:01,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 15:21:01,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:01,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:01,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:02,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:02,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 15:21:02,812 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:02,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:21:02,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:21:02,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:21:02,814 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 24 states. [2018-12-03 15:21:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:02,907 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-12-03 15:21:02,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:21:02,908 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-12-03 15:21:02,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:02,908 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:21:02,908 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:21:02,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:21:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:21:02,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 15:21:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 15:21:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-12-03 15:21:02,913 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 58 [2018-12-03 15:21:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:02,913 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-12-03 15:21:02,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:21:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-12-03 15:21:02,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 15:21:02,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:02,914 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:02,915 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:02,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:02,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1067269764, now seen corresponding path program 21 times [2018-12-03 15:21:02,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:02,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:02,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:02,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:02,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:03,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:03,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:03,773 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:03,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:03,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:03,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:03,790 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:03,791 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:03,829 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:03,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:03,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:03,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:04,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:04,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 15:21:04,450 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:04,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:21:04,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:21:04,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:21:04,452 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 25 states. [2018-12-03 15:21:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:04,632 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-12-03 15:21:04,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:21:04,633 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-12-03 15:21:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:04,634 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:21:04,634 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 15:21:04,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:21:04,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 15:21:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 15:21:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 15:21:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-12-03 15:21:04,638 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 60 [2018-12-03 15:21:04,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:04,638 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-12-03 15:21:04,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:21:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-12-03 15:21:04,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 15:21:04,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:04,639 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:04,639 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:04,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:04,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1837192584, now seen corresponding path program 22 times [2018-12-03 15:21:04,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:04,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:04,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:04,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:04,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:04,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:04,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:04,968 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:04,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:04,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:04,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:04,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:04,978 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:05,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:05,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:05,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:05,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 15:21:05,737 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:05,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:21:05,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:21:05,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:21:05,738 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 26 states. [2018-12-03 15:21:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:05,773 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-12-03 15:21:05,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:21:05,774 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-12-03 15:21:05,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:05,775 INFO L225 Difference]: With dead ends: 79 [2018-12-03 15:21:05,775 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 15:21:05,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:21:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 15:21:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 15:21:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 15:21:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-12-03 15:21:05,780 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 62 [2018-12-03 15:21:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:05,780 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-12-03 15:21:05,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:21:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-12-03 15:21:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 15:21:05,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:05,781 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:05,782 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:05,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:05,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1296319604, now seen corresponding path program 23 times [2018-12-03 15:21:05,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:05,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:05,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:05,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:05,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:06,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:06,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:06,332 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:06,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:06,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:06,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:06,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:06,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:06,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 15:21:06,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:06,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:06,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:07,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:07,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 15:21:07,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:07,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:21:07,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:21:07,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:21:07,153 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 27 states. [2018-12-03 15:21:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:07,214 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-12-03 15:21:07,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:21:07,215 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-12-03 15:21:07,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:07,216 INFO L225 Difference]: With dead ends: 81 [2018-12-03 15:21:07,216 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 15:21:07,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:21:07,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 15:21:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 15:21:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 15:21:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-12-03 15:21:07,223 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 64 [2018-12-03 15:21:07,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:07,223 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-12-03 15:21:07,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:21:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-12-03 15:21:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 15:21:07,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:07,224 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:07,224 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:07,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:07,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1829457776, now seen corresponding path program 24 times [2018-12-03 15:21:07,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:07,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:07,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:07,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:07,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:07,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:07,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:07,643 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:07,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:07,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:07,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:07,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:07,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:07,694 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:07,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:07,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:07,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:08,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:08,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 15:21:08,966 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:08,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:21:08,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:21:08,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:21:08,968 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 28 states. [2018-12-03 15:21:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:09,023 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-12-03 15:21:09,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:21:09,023 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 66 [2018-12-03 15:21:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:09,024 INFO L225 Difference]: With dead ends: 83 [2018-12-03 15:21:09,024 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 15:21:09,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:21:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 15:21:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 15:21:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 15:21:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-12-03 15:21:09,029 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 66 [2018-12-03 15:21:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:09,030 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-12-03 15:21:09,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:21:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-12-03 15:21:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 15:21:09,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:09,030 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:09,031 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:09,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:09,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1220834452, now seen corresponding path program 25 times [2018-12-03 15:21:09,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:09,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:09,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:09,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:09,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:09,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:09,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:09,463 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:09,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:09,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:09,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:09,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:09,474 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:09,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:09,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:10,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:10,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 15:21:10,327 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:10,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:21:10,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:21:10,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:21:10,328 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 29 states. [2018-12-03 15:21:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:10,421 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-12-03 15:21:10,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:21:10,422 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 68 [2018-12-03 15:21:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:10,423 INFO L225 Difference]: With dead ends: 85 [2018-12-03 15:21:10,423 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 15:21:10,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:21:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 15:21:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 15:21:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 15:21:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-12-03 15:21:10,427 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 68 [2018-12-03 15:21:10,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:10,428 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-12-03 15:21:10,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:21:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-12-03 15:21:10,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 15:21:10,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:10,428 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:10,428 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:10,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:10,429 INFO L82 PathProgramCache]: Analyzing trace with hash 910997608, now seen corresponding path program 26 times [2018-12-03 15:21:10,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:10,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:10,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:10,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:10,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:10,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:10,852 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:10,852 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:10,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:10,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:10,852 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:10,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:10,862 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:10,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 15:21:10,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:10,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:10,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:11,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:11,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 15:21:11,972 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:11,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:21:11,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:21:11,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:21:11,974 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 30 states. [2018-12-03 15:21:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:12,044 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-12-03 15:21:12,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:21:12,044 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 70 [2018-12-03 15:21:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:12,046 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:21:12,046 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:21:12,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:21:12,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:21:12,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 15:21:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 15:21:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-12-03 15:21:12,052 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 70 [2018-12-03 15:21:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:12,052 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-12-03 15:21:12,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:21:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-12-03 15:21:12,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 15:21:12,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:12,053 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:12,053 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:12,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:12,053 INFO L82 PathProgramCache]: Analyzing trace with hash 902207076, now seen corresponding path program 27 times [2018-12-03 15:21:12,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:12,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:12,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:12,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:12,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:12,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:12,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:12,882 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:12,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:12,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:12,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:12,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:12,893 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:12,946 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:12,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:12,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:12,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:14,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:14,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 15:21:14,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:14,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:21:14,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:21:14,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:21:14,312 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 31 states. [2018-12-03 15:21:14,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:14,386 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-12-03 15:21:14,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:21:14,386 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 72 [2018-12-03 15:21:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:14,387 INFO L225 Difference]: With dead ends: 89 [2018-12-03 15:21:14,387 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 15:21:14,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:21:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 15:21:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 15:21:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 15:21:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-12-03 15:21:14,393 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 72 [2018-12-03 15:21:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:14,393 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-12-03 15:21:14,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:21:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-12-03 15:21:14,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 15:21:14,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:14,394 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:14,394 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:14,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:14,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1044440416, now seen corresponding path program 28 times [2018-12-03 15:21:14,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:14,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:14,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:14,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:14,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:14,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:14,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:14,965 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:14,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:14,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:14,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:14,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:14,979 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:15,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:15,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:16,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:16,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 15:21:16,102 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:16,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:21:16,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:21:16,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:21:16,103 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 32 states. [2018-12-03 15:21:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:16,175 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-12-03 15:21:16,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:21:16,175 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 74 [2018-12-03 15:21:16,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:16,176 INFO L225 Difference]: With dead ends: 91 [2018-12-03 15:21:16,176 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 15:21:16,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:21:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 15:21:16,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 15:21:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 15:21:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-12-03 15:21:16,182 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 74 [2018-12-03 15:21:16,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:16,182 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-12-03 15:21:16,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:21:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-12-03 15:21:16,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 15:21:16,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:16,183 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:16,183 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:16,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:16,184 INFO L82 PathProgramCache]: Analyzing trace with hash 291726684, now seen corresponding path program 29 times [2018-12-03 15:21:16,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:16,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:16,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:16,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:16,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:16,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:16,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:16,869 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:16,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:16,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:16,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:16,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:16,882 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:16,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 15:21:16,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:16,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:16,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:18,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:18,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 15:21:18,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:18,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:21:18,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:21:18,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:21:18,077 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 33 states. [2018-12-03 15:21:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:18,156 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-12-03 15:21:18,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:21:18,157 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 76 [2018-12-03 15:21:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:18,157 INFO L225 Difference]: With dead ends: 93 [2018-12-03 15:21:18,157 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 15:21:18,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:21:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 15:21:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 15:21:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 15:21:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-12-03 15:21:18,163 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 76 [2018-12-03 15:21:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:18,163 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-12-03 15:21:18,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:21:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-12-03 15:21:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 15:21:18,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:18,164 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:18,164 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:18,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:18,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1511664040, now seen corresponding path program 30 times [2018-12-03 15:21:18,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:18,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:18,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:18,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:18,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:18,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:18,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:18,664 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:18,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:18,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:18,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:18,673 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:18,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:18,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:18,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:18,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:18,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:20,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:20,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 15:21:20,080 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:20,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:21:20,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:21:20,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:21:20,081 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 34 states. [2018-12-03 15:21:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:20,137 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-12-03 15:21:20,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:21:20,137 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 78 [2018-12-03 15:21:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:20,138 INFO L225 Difference]: With dead ends: 95 [2018-12-03 15:21:20,138 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 15:21:20,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:21:20,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 15:21:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 15:21:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 15:21:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-12-03 15:21:20,142 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 78 [2018-12-03 15:21:20,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:20,142 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-12-03 15:21:20,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:21:20,142 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-12-03 15:21:20,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 15:21:20,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:20,143 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:20,143 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:20,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:20,143 INFO L82 PathProgramCache]: Analyzing trace with hash 596637780, now seen corresponding path program 31 times [2018-12-03 15:21:20,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:20,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:20,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:20,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:20,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:20,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:20,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:20,666 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:20,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:20,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:20,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:20,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:20,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:20,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:20,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:22,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:22,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 15:21:22,088 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:22,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:21:22,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:21:22,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:21:22,089 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 35 states. [2018-12-03 15:21:22,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:22,197 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-12-03 15:21:22,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:21:22,198 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 80 [2018-12-03 15:21:22,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:22,199 INFO L225 Difference]: With dead ends: 97 [2018-12-03 15:21:22,199 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 15:21:22,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:21:22,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 15:21:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 15:21:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 15:21:22,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-12-03 15:21:22,205 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 80 [2018-12-03 15:21:22,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:22,205 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-12-03 15:21:22,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:21:22,206 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-12-03 15:21:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 15:21:22,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:22,206 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:22,206 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:22,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:22,207 INFO L82 PathProgramCache]: Analyzing trace with hash -549876912, now seen corresponding path program 32 times [2018-12-03 15:21:22,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:22,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:22,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:22,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:22,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:23,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:23,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:23,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:23,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:23,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:23,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:23,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:23,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:23,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 15:21:23,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:23,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:23,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:24,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:24,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 15:21:24,648 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:24,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:21:24,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:21:24,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:21:24,650 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 36 states. [2018-12-03 15:21:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:24,864 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-12-03 15:21:24,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:21:24,871 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 82 [2018-12-03 15:21:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:24,872 INFO L225 Difference]: With dead ends: 99 [2018-12-03 15:21:24,872 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:21:24,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:21:24,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:21:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 15:21:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 15:21:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2018-12-03 15:21:24,877 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 82 [2018-12-03 15:21:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:24,877 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-12-03 15:21:24,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:21:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2018-12-03 15:21:24,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 15:21:24,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:24,878 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:24,878 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:24,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:24,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1456099148, now seen corresponding path program 33 times [2018-12-03 15:21:24,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:24,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:24,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:24,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:24,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:25,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:25,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:25,972 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:25,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:25,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:25,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:25,982 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:25,983 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:26,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:26,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:26,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:26,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:27,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:27,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 15:21:27,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:27,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:21:27,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:21:27,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:21:27,379 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 37 states. [2018-12-03 15:21:27,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:27,444 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-12-03 15:21:27,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:21:27,444 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 84 [2018-12-03 15:21:27,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:27,445 INFO L225 Difference]: With dead ends: 101 [2018-12-03 15:21:27,445 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 15:21:27,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:21:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 15:21:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 15:21:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 15:21:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-12-03 15:21:27,452 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 84 [2018-12-03 15:21:27,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:27,452 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-12-03 15:21:27,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:21:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-12-03 15:21:27,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 15:21:27,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:27,453 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:27,453 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:27,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:27,453 INFO L82 PathProgramCache]: Analyzing trace with hash 758776904, now seen corresponding path program 34 times [2018-12-03 15:21:27,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:27,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:27,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:27,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:27,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:28,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:28,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:28,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:28,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:28,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:28,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:28,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:28,311 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:28,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:28,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:30,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:30,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 15:21:30,117 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:30,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:21:30,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:21:30,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:21:30,119 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 38 states. [2018-12-03 15:21:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:30,207 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-12-03 15:21:30,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:21:30,208 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2018-12-03 15:21:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:30,209 INFO L225 Difference]: With dead ends: 103 [2018-12-03 15:21:30,209 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 15:21:30,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:21:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 15:21:30,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 15:21:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 15:21:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-12-03 15:21:30,213 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 86 [2018-12-03 15:21:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:30,214 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-12-03 15:21:30,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:21:30,214 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-12-03 15:21:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 15:21:30,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:30,214 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:30,215 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:30,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:30,215 INFO L82 PathProgramCache]: Analyzing trace with hash 646998596, now seen corresponding path program 35 times [2018-12-03 15:21:30,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:30,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:30,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:30,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:30,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:30,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:30,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:30,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:30,895 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:30,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:30,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:30,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:30,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:30,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:30,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 15:21:30,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:30,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:31,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:32,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:32,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 15:21:32,684 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:32,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:21:32,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:21:32,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:21:32,685 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 39 states. [2018-12-03 15:21:32,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:32,740 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-12-03 15:21:32,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:21:32,740 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 88 [2018-12-03 15:21:32,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:32,741 INFO L225 Difference]: With dead ends: 105 [2018-12-03 15:21:32,741 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 15:21:32,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:21:32,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 15:21:32,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 15:21:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 15:21:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-12-03 15:21:32,748 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 88 [2018-12-03 15:21:32,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:32,749 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-12-03 15:21:32,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:21:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-12-03 15:21:32,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 15:21:32,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:32,750 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:32,750 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:32,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:32,750 INFO L82 PathProgramCache]: Analyzing trace with hash 602227008, now seen corresponding path program 36 times [2018-12-03 15:21:32,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:32,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:32,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:32,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:32,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:33,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:33,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:33,510 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:33,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:33,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:33,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:33,519 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:33,520 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:33,597 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:33,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:33,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:33,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:35,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:35,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 15:21:35,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:35,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:21:35,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:21:35,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:21:35,643 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 40 states. [2018-12-03 15:21:35,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:35,760 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-12-03 15:21:35,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:21:35,761 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2018-12-03 15:21:35,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:35,762 INFO L225 Difference]: With dead ends: 107 [2018-12-03 15:21:35,762 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 15:21:35,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:21:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 15:21:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 15:21:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 15:21:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2018-12-03 15:21:35,767 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 90 [2018-12-03 15:21:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:35,767 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-12-03 15:21:35,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:21:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-12-03 15:21:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 15:21:35,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:35,768 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:35,768 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:35,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:35,768 INFO L82 PathProgramCache]: Analyzing trace with hash 526403900, now seen corresponding path program 37 times [2018-12-03 15:21:35,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:35,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:35,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:35,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:35,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:36,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:36,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:36,566 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:36,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:36,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:36,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:36,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:36,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:36,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:36,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:38,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:38,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 15:21:38,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:38,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:21:38,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:21:38,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:21:38,390 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 41 states. [2018-12-03 15:21:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:38,458 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-12-03 15:21:38,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:21:38,459 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 92 [2018-12-03 15:21:38,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:38,459 INFO L225 Difference]: With dead ends: 109 [2018-12-03 15:21:38,459 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 15:21:38,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:21:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 15:21:38,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 15:21:38,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 15:21:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-12-03 15:21:38,465 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 92 [2018-12-03 15:21:38,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:38,465 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-12-03 15:21:38,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:21:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-12-03 15:21:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 15:21:38,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:38,466 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:38,466 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:38,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:38,466 INFO L82 PathProgramCache]: Analyzing trace with hash 674841144, now seen corresponding path program 38 times [2018-12-03 15:21:38,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:38,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:38,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:38,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:38,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:39,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:39,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:39,568 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:39,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:39,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:39,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:39,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:39,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:39,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 15:21:39,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:39,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:39,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:41,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:41,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 15:21:41,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:41,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:21:41,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:21:41,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:21:41,431 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 42 states. [2018-12-03 15:21:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:41,662 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-12-03 15:21:41,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:21:41,662 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 94 [2018-12-03 15:21:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:41,663 INFO L225 Difference]: With dead ends: 111 [2018-12-03 15:21:41,663 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 15:21:41,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:21:41,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 15:21:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 15:21:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 15:21:41,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-12-03 15:21:41,669 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 94 [2018-12-03 15:21:41,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:41,669 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-12-03 15:21:41,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:21:41,669 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-12-03 15:21:41,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 15:21:41,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:41,670 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:41,670 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:41,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:41,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1589111860, now seen corresponding path program 39 times [2018-12-03 15:21:41,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:41,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:41,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:41,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:41,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1658 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:42,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:42,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:42,775 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:42,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:42,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:42,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:42,783 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:42,783 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:42,863 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:42,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:42,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1658 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:42,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:45,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1658 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:45,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:45,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 15:21:45,077 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:45,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:21:45,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:21:45,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:21:45,078 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 43 states. [2018-12-03 15:21:45,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:45,208 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-12-03 15:21:45,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:21:45,209 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 96 [2018-12-03 15:21:45,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:45,210 INFO L225 Difference]: With dead ends: 113 [2018-12-03 15:21:45,210 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 15:21:45,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:21:45,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 15:21:45,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 15:21:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 15:21:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-12-03 15:21:45,216 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 96 [2018-12-03 15:21:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:45,216 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-12-03 15:21:45,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:21:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-12-03 15:21:45,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 15:21:45,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:45,217 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:45,218 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:45,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:45,218 INFO L82 PathProgramCache]: Analyzing trace with hash -265025744, now seen corresponding path program 40 times [2018-12-03 15:21:45,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:45,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:45,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:45,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:45,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:46,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:46,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:46,743 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:46,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:46,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:46,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:46,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:46,751 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:46,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:46,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:46,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:50,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:50,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 15:21:50,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:50,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:21:50,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:21:50,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:21:50,067 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 44 states. [2018-12-03 15:21:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:50,163 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-12-03 15:21:50,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:21:50,164 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 98 [2018-12-03 15:21:50,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:50,165 INFO L225 Difference]: With dead ends: 115 [2018-12-03 15:21:50,165 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 15:21:50,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:21:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 15:21:50,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 15:21:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 15:21:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-12-03 15:21:50,172 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 98 [2018-12-03 15:21:50,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:50,172 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-12-03 15:21:50,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:21:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-12-03 15:21:50,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 15:21:50,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:50,172 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:50,173 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:50,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:50,173 INFO L82 PathProgramCache]: Analyzing trace with hash 320164652, now seen corresponding path program 41 times [2018-12-03 15:21:50,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:50,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:50,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:50,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:50,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:52,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:52,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:52,032 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:52,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:52,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:52,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:52,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:52,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:52,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 15:21:52,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:52,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:52,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:52,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:54,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:54,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 15:21:54,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:54,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:21:54,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:21:54,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:21:54,319 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 45 states. [2018-12-03 15:21:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:54,732 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-12-03 15:21:54,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:21:54,732 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 100 [2018-12-03 15:21:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:54,733 INFO L225 Difference]: With dead ends: 117 [2018-12-03 15:21:54,733 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 15:21:54,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:21:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 15:21:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 15:21:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 15:21:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-12-03 15:21:54,740 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 100 [2018-12-03 15:21:54,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:54,741 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-12-03 15:21:54,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:21:54,741 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-12-03 15:21:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 15:21:54,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:54,742 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:54,742 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:54,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:54,742 INFO L82 PathProgramCache]: Analyzing trace with hash 47419432, now seen corresponding path program 42 times [2018-12-03 15:21:54,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:54,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:54,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:54,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:54,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1910 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:55,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:55,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:55,603 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:55,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:55,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:55,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:55,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:55,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:55,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:55,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:55,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1910 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:55,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1910 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:57,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:57,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 15:21:57,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:57,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:21:57,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:21:57,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:21:57,795 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 46 states. [2018-12-03 15:21:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:57,868 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-12-03 15:21:57,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:21:57,878 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 102 [2018-12-03 15:21:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:57,879 INFO L225 Difference]: With dead ends: 119 [2018-12-03 15:21:57,879 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 15:21:57,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:21:57,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 15:21:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 15:21:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 15:21:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-12-03 15:21:57,885 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 102 [2018-12-03 15:21:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:57,885 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-12-03 15:21:57,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:21:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-12-03 15:21:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 15:21:57,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:57,886 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:21:57,887 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:57,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash -67731932, now seen corresponding path program 43 times [2018-12-03 15:21:57,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:57,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:57,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:58,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:58,916 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:58,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:58,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:58,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:58,926 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:59,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:21:59,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:01,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:01,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 15:22:01,465 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:01,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:22:01,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:22:01,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:22:01,467 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2018-12-03 15:22:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:02,029 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-12-03 15:22:02,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:22:02,030 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2018-12-03 15:22:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:02,030 INFO L225 Difference]: With dead ends: 121 [2018-12-03 15:22:02,030 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 15:22:02,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:22:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 15:22:02,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 15:22:02,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 15:22:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-12-03 15:22:02,038 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 104 [2018-12-03 15:22:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:02,039 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-12-03 15:22:02,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:22:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-12-03 15:22:02,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 15:22:02,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:02,040 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:22:02,040 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:02,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:02,040 INFO L82 PathProgramCache]: Analyzing trace with hash 940956960, now seen corresponding path program 44 times [2018-12-03 15:22:02,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:02,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:02,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:03,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:03,249 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:03,249 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:03,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:03,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:03,249 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:03,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:03,259 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:03,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 15:22:03,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:03,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:03,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:06,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:06,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 15:22:06,036 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:06,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:22:06,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:22:06,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:22:06,037 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 48 states. [2018-12-03 15:22:06,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:06,227 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-12-03 15:22:06,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:22:06,228 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 106 [2018-12-03 15:22:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:06,229 INFO L225 Difference]: With dead ends: 123 [2018-12-03 15:22:06,229 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 15:22:06,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:22:06,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 15:22:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 15:22:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 15:22:06,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-12-03 15:22:06,238 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 106 [2018-12-03 15:22:06,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:06,238 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-12-03 15:22:06,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:22:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-12-03 15:22:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 15:22:06,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:06,239 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:22:06,239 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:06,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:06,239 INFO L82 PathProgramCache]: Analyzing trace with hash -371626724, now seen corresponding path program 45 times [2018-12-03 15:22:06,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:06,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:06,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:07,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:07,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:07,333 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:07,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:07,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:07,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:07,343 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:07,343 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:07,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:07,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:07,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:07,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:09,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:09,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 15:22:09,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:09,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:22:09,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:22:09,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:22:09,947 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 49 states. [2018-12-03 15:22:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:10,155 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-12-03 15:22:10,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:22:10,155 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 108 [2018-12-03 15:22:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:10,156 INFO L225 Difference]: With dead ends: 125 [2018-12-03 15:22:10,156 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 15:22:10,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:22:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 15:22:10,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 15:22:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 15:22:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-12-03 15:22:10,164 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 108 [2018-12-03 15:22:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:10,165 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-12-03 15:22:10,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:22:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-12-03 15:22:10,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 15:22:10,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:10,166 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:22:10,166 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:10,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:10,166 INFO L82 PathProgramCache]: Analyzing trace with hash 955837976, now seen corresponding path program 46 times [2018-12-03 15:22:10,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:10,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:10,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:10,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:10,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:11,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:11,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:11,112 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:11,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:11,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:11,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:11,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:11,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:11,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:11,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:13,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:13,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 15:22:13,705 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:13,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:22:13,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:22:13,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:22:13,707 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 50 states. [2018-12-03 15:22:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:13,891 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-12-03 15:22:13,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:22:13,892 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 110 [2018-12-03 15:22:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:13,893 INFO L225 Difference]: With dead ends: 127 [2018-12-03 15:22:13,893 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 15:22:13,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:22:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 15:22:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 15:22:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 15:22:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-12-03 15:22:13,900 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 110 [2018-12-03 15:22:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:13,900 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-12-03 15:22:13,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:22:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-12-03 15:22:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 15:22:13,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:13,901 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:22:13,902 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:13,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:13,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1044127764, now seen corresponding path program 47 times [2018-12-03 15:22:13,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:13,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:13,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2370 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:14,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:14,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:14,895 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:14,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:14,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:14,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:14,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:14,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:15,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 15:22:15,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:15,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2370 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:15,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2370 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:17,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:17,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 15:22:17,911 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:17,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:22:17,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:22:17,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:22:17,912 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 51 states. [2018-12-03 15:22:18,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:18,030 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-12-03 15:22:18,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:22:18,033 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 112 [2018-12-03 15:22:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:18,034 INFO L225 Difference]: With dead ends: 129 [2018-12-03 15:22:18,035 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 15:22:18,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:22:18,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 15:22:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 15:22:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 15:22:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-12-03 15:22:18,041 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 112 [2018-12-03 15:22:18,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:18,041 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-12-03 15:22:18,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:22:18,041 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-12-03 15:22:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 15:22:18,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:18,042 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:22:18,042 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:18,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:18,043 INFO L82 PathProgramCache]: Analyzing trace with hash -8731888, now seen corresponding path program 48 times [2018-12-03 15:22:18,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:18,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:18,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:18,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:18,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:19,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2468 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:19,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:19,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:19,087 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:19,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:19,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:19,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:19,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:19,096 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:19,169 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:19,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:19,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2468 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:19,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2468 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:22,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:22,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 15:22:22,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:22,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:22:22,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:22:22,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:22:22,479 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 52 states. [2018-12-03 15:22:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:22,580 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-12-03 15:22:22,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:22:22,580 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 114 [2018-12-03 15:22:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:22,582 INFO L225 Difference]: With dead ends: 131 [2018-12-03 15:22:22,582 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 15:22:22,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:22:22,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 15:22:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-03 15:22:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 15:22:22,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2018-12-03 15:22:22,588 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 114 [2018-12-03 15:22:22,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:22,588 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2018-12-03 15:22:22,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:22:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2018-12-03 15:22:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 15:22:22,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:22,589 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:22:22,589 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:22,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:22,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1805424396, now seen corresponding path program 49 times [2018-12-03 15:22:22,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:22,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:22,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:22,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:22,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:23,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:23,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:23,622 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:23,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:23,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:23,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:23,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:23,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:23,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:23,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:27,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:27,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 15:22:27,271 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:27,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:22:27,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:22:27,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:22:27,273 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 53 states. [2018-12-03 15:22:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:27,434 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-12-03 15:22:27,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:22:27,434 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 116 [2018-12-03 15:22:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:27,436 INFO L225 Difference]: With dead ends: 133 [2018-12-03 15:22:27,436 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 15:22:27,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:22:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 15:22:27,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-03 15:22:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-03 15:22:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-12-03 15:22:27,444 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 116 [2018-12-03 15:22:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:27,445 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-12-03 15:22:27,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:22:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-12-03 15:22:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 15:22:27,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:27,446 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:22:27,446 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:27,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:27,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1452891144, now seen corresponding path program 50 times [2018-12-03 15:22:27,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:27,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:27,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:27,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:27,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:28,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:28,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:28,649 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:28,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:28,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:28,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:28,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:28,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:28,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 15:22:28,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:28,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:28,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:32,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:32,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 15:22:32,425 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:32,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:22:32,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:22:32,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:22:32,426 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 54 states. [2018-12-03 15:22:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:32,511 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-12-03 15:22:32,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:22:32,512 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 118 [2018-12-03 15:22:32,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:32,513 INFO L225 Difference]: With dead ends: 135 [2018-12-03 15:22:32,513 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 15:22:32,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:22:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 15:22:32,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-03 15:22:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 15:22:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2018-12-03 15:22:32,520 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 118 [2018-12-03 15:22:32,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:32,520 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-12-03 15:22:32,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:22:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2018-12-03 15:22:32,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 15:22:32,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:32,521 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:22:32,521 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:32,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:32,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1970852356, now seen corresponding path program 51 times [2018-12-03 15:22:32,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:32,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:32,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:32,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:32,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:33,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:33,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:33,606 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:33,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:33,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:33,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:33,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:33,615 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:33,689 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:33,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:33,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:33,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:37,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:37,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 15:22:37,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:37,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 15:22:37,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 15:22:37,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 15:22:37,403 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. Second operand 55 states. [2018-12-03 15:22:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:37,556 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-12-03 15:22:37,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:22:37,557 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 120 [2018-12-03 15:22:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:37,558 INFO L225 Difference]: With dead ends: 137 [2018-12-03 15:22:37,558 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 15:22:37,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 15:22:37,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 15:22:37,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-03 15:22:37,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 15:22:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 125 transitions. [2018-12-03 15:22:37,565 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 125 transitions. Word has length 120 [2018-12-03 15:22:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:37,565 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 125 transitions. [2018-12-03 15:22:37,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 15:22:37,565 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-12-03 15:22:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 15:22:37,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:37,566 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:22:37,566 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:37,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:37,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1515370752, now seen corresponding path program 52 times [2018-12-03 15:22:37,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:37,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:37,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:37,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:37,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2880 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:38,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:38,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:38,673 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:38,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:38,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:38,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:38,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:38,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:38,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2880 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:38,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2880 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:42,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:42,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 15:22:42,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:42,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:22:42,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:22:42,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:22:42,072 INFO L87 Difference]: Start difference. First operand 123 states and 125 transitions. Second operand 56 states. [2018-12-03 15:22:42,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:42,215 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-12-03 15:22:42,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:22:42,216 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 122 [2018-12-03 15:22:42,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:42,217 INFO L225 Difference]: With dead ends: 139 [2018-12-03 15:22:42,217 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 15:22:42,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:22:42,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 15:22:42,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-03 15:22:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-03 15:22:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2018-12-03 15:22:42,225 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 122 [2018-12-03 15:22:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:42,225 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2018-12-03 15:22:42,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:22:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2018-12-03 15:22:42,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 15:22:42,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:42,226 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:22:42,226 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:42,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:42,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1884213500, now seen corresponding path program 53 times [2018-12-03 15:22:42,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:42,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:42,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:42,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:42,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2988 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:43,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:43,536 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:43,536 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:43,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:43,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:43,536 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:43,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:43,545 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:43,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 15:22:43,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:43,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:43,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2988 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:43,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2988 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:47,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:47,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 15:22:47,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:47,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 15:22:47,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 15:22:47,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:22:47,185 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 57 states. [2018-12-03 15:22:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:47,328 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-12-03 15:22:47,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:22:47,328 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 124 [2018-12-03 15:22:47,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:47,329 INFO L225 Difference]: With dead ends: 141 [2018-12-03 15:22:47,329 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 15:22:47,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:22:47,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 15:22:47,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 15:22:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 15:22:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2018-12-03 15:22:47,337 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 124 [2018-12-03 15:22:47,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:47,337 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-12-03 15:22:47,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 15:22:47,337 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2018-12-03 15:22:47,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 15:22:47,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:47,338 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:22:47,338 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:47,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:47,338 INFO L82 PathProgramCache]: Analyzing trace with hash -140191240, now seen corresponding path program 54 times [2018-12-03 15:22:47,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:47,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:47,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:47,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:47,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3098 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:48,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:48,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:48,520 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:48,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:48,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:48,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:48,529 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:48,529 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:48,604 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:48,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:48,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3098 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:48,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3098 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:52,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:52,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 15:22:52,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:52,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 15:22:52,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 15:22:52,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:22:52,145 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand 58 states. [2018-12-03 15:22:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:52,260 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-12-03 15:22:52,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 15:22:52,261 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 126 [2018-12-03 15:22:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:52,262 INFO L225 Difference]: With dead ends: 143 [2018-12-03 15:22:52,262 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 15:22:52,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:22:52,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 15:22:52,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-03 15:22:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 15:22:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2018-12-03 15:22:52,269 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 126 [2018-12-03 15:22:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:52,269 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2018-12-03 15:22:52,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 15:22:52,269 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2018-12-03 15:22:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 15:22:52,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:52,270 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:22:52,270 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:52,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:52,271 INFO L82 PathProgramCache]: Analyzing trace with hash 27038708, now seen corresponding path program 55 times [2018-12-03 15:22:52,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:52,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:52,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:52,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:53,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3210 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:53,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:53,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:53,499 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:53,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:53,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:53,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:53,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:53,509 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:53,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3210 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:53,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3210 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:57,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:57,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 15:22:57,179 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:57,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 15:22:57,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 15:22:57,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:22:57,181 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2018-12-03 15:22:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:57,312 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-12-03 15:22:57,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:22:57,312 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2018-12-03 15:22:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:57,313 INFO L225 Difference]: With dead ends: 145 [2018-12-03 15:22:57,314 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 15:22:57,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:22:57,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 15:22:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-03 15:22:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 15:22:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-12-03 15:22:57,322 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 128 [2018-12-03 15:22:57,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:57,322 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-12-03 15:22:57,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 15:22:57,322 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-12-03 15:22:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 15:22:57,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:57,323 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:22:57,323 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:57,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:57,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1821228784, now seen corresponding path program 56 times [2018-12-03 15:22:57,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:57,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:57,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:57,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:57,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3324 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:58,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:58,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:58,697 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:58,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:58,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:58,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:58,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:58,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:58,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-03 15:22:58,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:58,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3324 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:22:58,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3324 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:02,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:02,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 15:23:02,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:02,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:23:02,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:23:02,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:23:02,719 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 60 states. [2018-12-03 15:23:02,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:02,875 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-12-03 15:23:02,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:23:02,875 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 130 [2018-12-03 15:23:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:02,876 INFO L225 Difference]: With dead ends: 147 [2018-12-03 15:23:02,876 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 15:23:02,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:23:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 15:23:02,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 15:23:02,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 15:23:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-12-03 15:23:02,883 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 130 [2018-12-03 15:23:02,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:02,883 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-12-03 15:23:02,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:23:02,883 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-12-03 15:23:02,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 15:23:02,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:02,884 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:23:02,884 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:02,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:02,884 INFO L82 PathProgramCache]: Analyzing trace with hash -538961172, now seen corresponding path program 57 times [2018-12-03 15:23:02,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:02,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:02,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:02,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:02,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3440 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:04,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:04,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:04,225 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:04,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:04,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:04,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:04,240 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:04,240 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:04,322 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:04,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:04,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3440 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:04,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3440 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:08,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:08,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 15:23:08,368 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:08,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 15:23:08,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 15:23:08,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:23:08,369 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 61 states. [2018-12-03 15:23:08,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:08,526 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2018-12-03 15:23:08,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 15:23:08,526 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 132 [2018-12-03 15:23:08,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:08,527 INFO L225 Difference]: With dead ends: 149 [2018-12-03 15:23:08,527 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 15:23:08,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:23:08,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 15:23:08,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-03 15:23:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 15:23:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2018-12-03 15:23:08,533 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 132 [2018-12-03 15:23:08,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:08,533 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-12-03 15:23:08,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 15:23:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-12-03 15:23:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 15:23:08,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:08,534 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:23:08,534 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:08,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:08,535 INFO L82 PathProgramCache]: Analyzing trace with hash -938776600, now seen corresponding path program 58 times [2018-12-03 15:23:08,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:08,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:08,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:08,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:08,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3558 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:09,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:09,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:09,919 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:09,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:09,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:09,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:09,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:09,928 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:10,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3558 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:10,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3558 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:14,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:14,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 15:23:14,153 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:14,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:23:14,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:23:14,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:23:14,155 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 62 states. [2018-12-03 15:23:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:14,257 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2018-12-03 15:23:14,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 15:23:14,257 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 134 [2018-12-03 15:23:14,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:14,258 INFO L225 Difference]: With dead ends: 151 [2018-12-03 15:23:14,258 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 15:23:14,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:23:14,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 15:23:14,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-03 15:23:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-03 15:23:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2018-12-03 15:23:14,264 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 134 [2018-12-03 15:23:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:14,264 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2018-12-03 15:23:14,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:23:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2018-12-03 15:23:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 15:23:14,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:14,264 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:23:14,265 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:14,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:14,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1385653732, now seen corresponding path program 59 times [2018-12-03 15:23:14,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:14,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:14,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:14,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:14,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3678 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:15,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:15,658 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:15,658 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:15,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:15,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:15,659 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:15,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:15,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:15,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2018-12-03 15:23:15,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:15,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3678 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:15,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3678 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:20,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:20,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 15:23:20,022 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:20,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 15:23:20,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 15:23:20,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:23:20,023 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand 63 states. [2018-12-03 15:23:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:20,189 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-12-03 15:23:20,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 15:23:20,189 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 136 [2018-12-03 15:23:20,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:20,190 INFO L225 Difference]: With dead ends: 153 [2018-12-03 15:23:20,190 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 15:23:20,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:23:20,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 15:23:20,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 15:23:20,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 15:23:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2018-12-03 15:23:20,196 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 136 [2018-12-03 15:23:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:20,196 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2018-12-03 15:23:20,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 15:23:20,196 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2018-12-03 15:23:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 15:23:20,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:20,197 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:23:20,197 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:20,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:20,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1780208864, now seen corresponding path program 60 times [2018-12-03 15:23:20,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:20,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:20,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:20,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:20,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:21,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:21,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:21,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:21,828 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:21,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:21,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:21,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:21,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:21,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:21,923 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:21,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:21,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:21,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:26,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:26,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 15:23:26,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:26,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:23:26,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:23:26,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:23:26,077 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand 64 states. [2018-12-03 15:23:26,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:26,263 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-12-03 15:23:26,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:23:26,264 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 138 [2018-12-03 15:23:26,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:26,265 INFO L225 Difference]: With dead ends: 155 [2018-12-03 15:23:26,265 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 15:23:26,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:23:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 15:23:26,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-03 15:23:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 15:23:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2018-12-03 15:23:26,272 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 138 [2018-12-03 15:23:26,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:26,273 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2018-12-03 15:23:26,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:23:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2018-12-03 15:23:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 15:23:26,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:26,274 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:23:26,274 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:26,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:26,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1304398628, now seen corresponding path program 61 times [2018-12-03 15:23:26,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:26,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:26,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:26,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:26,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3924 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:28,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:28,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:28,122 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:28,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:28,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:28,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:28,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:28,132 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:28,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3924 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:28,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3924 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:32,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:32,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 15:23:32,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:32,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 15:23:32,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 15:23:32,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:23:32,634 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand 65 states. [2018-12-03 15:23:32,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:32,817 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-12-03 15:23:32,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 15:23:32,817 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 140 [2018-12-03 15:23:32,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:32,819 INFO L225 Difference]: With dead ends: 157 [2018-12-03 15:23:32,819 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 15:23:32,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:23:32,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 15:23:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-12-03 15:23:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-03 15:23:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2018-12-03 15:23:32,824 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 140 [2018-12-03 15:23:32,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:32,825 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2018-12-03 15:23:32,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 15:23:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2018-12-03 15:23:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 15:23:32,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:32,826 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:23:32,826 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:32,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:32,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2084764200, now seen corresponding path program 62 times [2018-12-03 15:23:32,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:32,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:32,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:32,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:32,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:34,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:34,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:34,363 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:34,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:34,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:34,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:34,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:34,373 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:34,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-12-03 15:23:34,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:34,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:34,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:39,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:39,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 15:23:39,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:39,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 15:23:39,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 15:23:39,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:23:39,083 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 66 states. [2018-12-03 15:23:39,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:39,271 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2018-12-03 15:23:39,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:23:39,271 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 142 [2018-12-03 15:23:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:39,272 INFO L225 Difference]: With dead ends: 159 [2018-12-03 15:23:39,272 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 15:23:39,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:23:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 15:23:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-03 15:23:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 15:23:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2018-12-03 15:23:39,278 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 142 [2018-12-03 15:23:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:39,278 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-12-03 15:23:39,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 15:23:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2018-12-03 15:23:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 15:23:39,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:39,280 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:23:39,280 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:39,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:39,280 INFO L82 PathProgramCache]: Analyzing trace with hash -396802092, now seen corresponding path program 63 times [2018-12-03 15:23:39,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:39,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:39,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:39,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:39,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:41,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:41,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:41,142 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:41,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:41,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:41,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:41,154 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:41,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:41,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:41,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:41,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:41,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:45,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:45,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:45,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 15:23:45,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:45,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 15:23:45,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 15:23:45,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:23:45,903 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 67 states. [2018-12-03 15:23:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:46,027 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-12-03 15:23:46,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 15:23:46,028 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 144 [2018-12-03 15:23:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:46,029 INFO L225 Difference]: With dead ends: 161 [2018-12-03 15:23:46,029 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 15:23:46,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:23:46,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 15:23:46,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-03 15:23:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 15:23:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2018-12-03 15:23:46,037 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 144 [2018-12-03 15:23:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:46,038 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2018-12-03 15:23:46,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 15:23:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2018-12-03 15:23:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 15:23:46,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:46,039 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:23:46,039 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:46,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:46,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1762854192, now seen corresponding path program 64 times [2018-12-03 15:23:46,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:46,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:46,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:46,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:46,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4308 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:48,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:48,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:48,059 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:48,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:48,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:48,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:48,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:48,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:48,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4308 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:48,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4308 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:53,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:53,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 15:23:53,727 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:53,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:23:53,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:23:53,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:23:53,729 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 68 states. [2018-12-03 15:23:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:54,507 INFO L93 Difference]: Finished difference Result 163 states and 167 transitions. [2018-12-03 15:23:54,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:23:54,508 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 146 [2018-12-03 15:23:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:54,509 INFO L225 Difference]: With dead ends: 163 [2018-12-03 15:23:54,509 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 15:23:54,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:23:54,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 15:23:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-12-03 15:23:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-03 15:23:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 151 transitions. [2018-12-03 15:23:54,517 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 151 transitions. Word has length 146 [2018-12-03 15:23:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:54,518 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 151 transitions. [2018-12-03 15:23:54,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:23:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 151 transitions. [2018-12-03 15:23:54,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 15:23:54,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:54,519 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:23:54,519 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:54,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:54,519 INFO L82 PathProgramCache]: Analyzing trace with hash -278929716, now seen corresponding path program 65 times [2018-12-03 15:23:54,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:54,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:54,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:54,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:54,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4440 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:56,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:56,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:56,280 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:56,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:56,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:56,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:56,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:56,291 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:56,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 67 check-sat command(s) [2018-12-03 15:23:56,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:56,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4440 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:23:56,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4440 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:01,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:01,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 15:24:01,414 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:01,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 15:24:01,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 15:24:01,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 15:24:01,415 INFO L87 Difference]: Start difference. First operand 149 states and 151 transitions. Second operand 69 states. [2018-12-03 15:24:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:01,582 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2018-12-03 15:24:01,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:24:01,582 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 148 [2018-12-03 15:24:01,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:01,584 INFO L225 Difference]: With dead ends: 165 [2018-12-03 15:24:01,584 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 15:24:01,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 15:24:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 15:24:01,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 15:24:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 15:24:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2018-12-03 15:24:01,592 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 153 transitions. Word has length 148 [2018-12-03 15:24:01,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:01,593 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 153 transitions. [2018-12-03 15:24:01,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 15:24:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2018-12-03 15:24:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 15:24:01,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:01,594 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:24:01,594 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:01,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:01,594 INFO L82 PathProgramCache]: Analyzing trace with hash -156650552, now seen corresponding path program 66 times [2018-12-03 15:24:01,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:01,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:01,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:01,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:01,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4574 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:03,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:03,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:03,602 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:03,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:03,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:03,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:03,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:24:03,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:24:03,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:24:03,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:03,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4574 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:03,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4574 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:08,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:08,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 15:24:08,995 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:08,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 15:24:08,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 15:24:08,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:24:08,997 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. Second operand 70 states. [2018-12-03 15:24:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:09,127 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2018-12-03 15:24:09,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 15:24:09,128 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 150 [2018-12-03 15:24:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:09,129 INFO L225 Difference]: With dead ends: 167 [2018-12-03 15:24:09,129 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 15:24:09,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:24:09,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 15:24:09,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-03 15:24:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 15:24:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 155 transitions. [2018-12-03 15:24:09,135 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 155 transitions. Word has length 150 [2018-12-03 15:24:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:09,135 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 155 transitions. [2018-12-03 15:24:09,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 15:24:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 155 transitions. [2018-12-03 15:24:09,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 15:24:09,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:09,136 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:24:09,136 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:09,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:09,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1389509060, now seen corresponding path program 67 times [2018-12-03 15:24:09,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:09,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:09,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:09,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:09,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:11,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4710 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:11,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:11,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:11,134 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:11,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:11,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:11,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:11,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:11,142 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:24:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:11,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4710 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:11,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4710 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:16,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:16,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 15:24:16,542 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:16,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 15:24:16,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 15:24:16,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:24:16,543 INFO L87 Difference]: Start difference. First operand 153 states and 155 transitions. Second operand 71 states. [2018-12-03 15:24:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:16,684 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2018-12-03 15:24:16,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 15:24:16,684 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 152 [2018-12-03 15:24:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:16,685 INFO L225 Difference]: With dead ends: 169 [2018-12-03 15:24:16,685 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 15:24:16,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:24:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 15:24:16,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-03 15:24:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-03 15:24:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 157 transitions. [2018-12-03 15:24:16,691 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 157 transitions. Word has length 152 [2018-12-03 15:24:16,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:16,691 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 157 transitions. [2018-12-03 15:24:16,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 15:24:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 157 transitions. [2018-12-03 15:24:16,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 15:24:16,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:16,692 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:24:16,692 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:16,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:16,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1190211776, now seen corresponding path program 68 times [2018-12-03 15:24:16,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:16,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:16,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:16,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:16,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4848 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:18,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:18,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:18,860 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:18,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:18,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:18,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:18,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:24:18,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:24:19,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-12-03 15:24:19,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:19,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4848 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:19,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4848 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:24,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:24,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 15:24:24,522 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:24,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 15:24:24,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 15:24:24,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:24:24,524 INFO L87 Difference]: Start difference. First operand 155 states and 157 transitions. Second operand 72 states. [2018-12-03 15:24:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:24,728 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2018-12-03 15:24:24,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 15:24:24,728 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 154 [2018-12-03 15:24:24,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:24,729 INFO L225 Difference]: With dead ends: 171 [2018-12-03 15:24:24,730 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 15:24:24,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:24:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 15:24:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 15:24:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 15:24:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2018-12-03 15:24:24,738 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 154 [2018-12-03 15:24:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:24,738 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2018-12-03 15:24:24,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 15:24:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2018-12-03 15:24:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 15:24:24,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:24,739 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:24:24,739 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:24,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:24,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1355917124, now seen corresponding path program 69 times [2018-12-03 15:24:24,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:24,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:24,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4988 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:26,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:26,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:26,679 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:26,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:26,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:26,680 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:26,688 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:24:26,688 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:24:26,788 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:24:26,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:26,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4988 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:26,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4988 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:32,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:32,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 15:24:32,292 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:32,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 15:24:32,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 15:24:32,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 15:24:32,293 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 73 states. [2018-12-03 15:24:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:32,487 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions. [2018-12-03 15:24:32,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 15:24:32,487 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 156 [2018-12-03 15:24:32,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:32,488 INFO L225 Difference]: With dead ends: 173 [2018-12-03 15:24:32,488 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 15:24:32,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 15:24:32,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 15:24:32,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-03 15:24:32,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-03 15:24:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 161 transitions. [2018-12-03 15:24:32,495 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 161 transitions. Word has length 156 [2018-12-03 15:24:32,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:32,495 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 161 transitions. [2018-12-03 15:24:32,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 15:24:32,495 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 161 transitions. [2018-12-03 15:24:32,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 15:24:32,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:32,496 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:24:32,496 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:32,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:32,496 INFO L82 PathProgramCache]: Analyzing trace with hash -54431304, now seen corresponding path program 70 times [2018-12-03 15:24:32,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:32,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:32,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:32,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:32,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:34,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:34,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:34,809 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:34,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:34,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:34,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:34,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:34,819 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:24:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:34,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:34,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:34,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:40,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:40,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 15:24:40,530 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:40,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 15:24:40,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 15:24:40,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:24:40,532 INFO L87 Difference]: Start difference. First operand 159 states and 161 transitions. Second operand 74 states. [2018-12-03 15:24:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:40,800 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2018-12-03 15:24:40,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 15:24:40,801 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 158 [2018-12-03 15:24:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:40,802 INFO L225 Difference]: With dead ends: 175 [2018-12-03 15:24:40,802 INFO L226 Difference]: Without dead ends: 161 [2018-12-03 15:24:40,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:24:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-03 15:24:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-12-03 15:24:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 15:24:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2018-12-03 15:24:40,810 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 158 [2018-12-03 15:24:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:40,810 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2018-12-03 15:24:40,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 15:24:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2018-12-03 15:24:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 15:24:40,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:40,811 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:24:40,812 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:40,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:40,812 INFO L82 PathProgramCache]: Analyzing trace with hash 837958580, now seen corresponding path program 71 times [2018-12-03 15:24:40,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:40,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:40,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:40,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:40,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5274 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:42,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:42,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:42,821 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:42,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:42,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:42,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:42,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:24:42,829 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:24:43,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 73 check-sat command(s) [2018-12-03 15:24:43,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:43,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5274 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:43,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:49,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5274 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:49,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:49,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 15:24:49,285 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:49,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 15:24:49,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 15:24:49,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 15:24:49,287 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 75 states. [2018-12-03 15:24:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:49,403 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2018-12-03 15:24:49,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 15:24:49,404 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 160 [2018-12-03 15:24:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:49,405 INFO L225 Difference]: With dead ends: 177 [2018-12-03 15:24:49,406 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 15:24:49,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 15:24:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 15:24:49,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-03 15:24:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 15:24:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 165 transitions. [2018-12-03 15:24:49,414 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 165 transitions. Word has length 160 [2018-12-03 15:24:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:49,414 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 165 transitions. [2018-12-03 15:24:49,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 15:24:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 165 transitions. [2018-12-03 15:24:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 15:24:49,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:49,415 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:24:49,415 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:49,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:49,416 INFO L82 PathProgramCache]: Analyzing trace with hash -568822096, now seen corresponding path program 72 times [2018-12-03 15:24:49,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:49,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:49,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:49,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:49,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5420 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:51,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:51,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:51,475 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:51,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:51,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:51,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:51,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:24:51,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:24:51,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:24:51,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:51,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5420 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:51,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5420 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:24:57,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:57,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 15:24:57,775 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:57,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 15:24:57,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 15:24:57,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:24:57,777 INFO L87 Difference]: Start difference. First operand 163 states and 165 transitions. Second operand 76 states. [2018-12-03 15:24:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:57,936 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2018-12-03 15:24:57,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 15:24:57,937 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 162 [2018-12-03 15:24:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:57,937 INFO L225 Difference]: With dead ends: 179 [2018-12-03 15:24:57,937 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 15:24:57,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:24:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 15:24:57,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-12-03 15:24:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 15:24:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 167 transitions. [2018-12-03 15:24:57,944 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 167 transitions. Word has length 162 [2018-12-03 15:24:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:57,944 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 167 transitions. [2018-12-03 15:24:57,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 15:24:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 167 transitions. [2018-12-03 15:24:57,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 15:24:57,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:57,945 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:24:57,945 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:57,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:57,946 INFO L82 PathProgramCache]: Analyzing trace with hash 429646508, now seen corresponding path program 73 times [2018-12-03 15:24:57,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:57,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:57,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:00,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:00,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:00,284 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:00,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:00,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:00,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:00,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:25:00,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:25:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:00,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:00,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:06,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:06,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 15:25:06,673 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:06,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 15:25:06,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 15:25:06,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 15:25:06,674 INFO L87 Difference]: Start difference. First operand 165 states and 167 transitions. Second operand 77 states. [2018-12-03 15:25:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:06,830 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2018-12-03 15:25:06,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 15:25:06,830 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 164 [2018-12-03 15:25:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:06,831 INFO L225 Difference]: With dead ends: 181 [2018-12-03 15:25:06,831 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 15:25:06,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 15:25:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 15:25:06,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-12-03 15:25:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-03 15:25:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2018-12-03 15:25:06,837 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 164 [2018-12-03 15:25:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:06,837 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2018-12-03 15:25:06,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 15:25:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2018-12-03 15:25:06,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-03 15:25:06,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:06,838 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:25:06,838 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:06,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:06,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2114699352, now seen corresponding path program 74 times [2018-12-03 15:25:06,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:06,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:06,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:25:06,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:06,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5718 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:09,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:09,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:09,014 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:09,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:09,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:09,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:09,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:25:09,022 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:25:09,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-12-03 15:25:09,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:09,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5718 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:09,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5718 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:15,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:15,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 15:25:15,626 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:15,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 15:25:15,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 15:25:15,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 15:25:15,628 INFO L87 Difference]: Start difference. First operand 167 states and 169 transitions. Second operand 78 states. [2018-12-03 15:25:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:15,784 INFO L93 Difference]: Finished difference Result 183 states and 187 transitions. [2018-12-03 15:25:15,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 15:25:15,785 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 166 [2018-12-03 15:25:15,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:15,786 INFO L225 Difference]: With dead ends: 183 [2018-12-03 15:25:15,786 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 15:25:15,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 15:25:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 15:25:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-03 15:25:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-03 15:25:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 171 transitions. [2018-12-03 15:25:15,794 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 171 transitions. Word has length 166 [2018-12-03 15:25:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:15,794 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 171 transitions. [2018-12-03 15:25:15,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 15:25:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 171 transitions. [2018-12-03 15:25:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 15:25:15,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:15,795 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:25:15,795 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:15,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:15,795 INFO L82 PathProgramCache]: Analyzing trace with hash 900287908, now seen corresponding path program 75 times [2018-12-03 15:25:15,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:15,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:15,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:25:15,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:15,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5870 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:17,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:17,970 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:17,971 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:17,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:17,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:17,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:17,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:25:17,979 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:25:18,082 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:25:18,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:18,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:18,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5870 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:18,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5870 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:25,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:25,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 15:25:25,053 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:25,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 15:25:25,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 15:25:25,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 15:25:25,054 INFO L87 Difference]: Start difference. First operand 169 states and 171 transitions. Second operand 79 states. [2018-12-03 15:25:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:25,298 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2018-12-03 15:25:25,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 15:25:25,299 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 168 [2018-12-03 15:25:25,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:25,299 INFO L225 Difference]: With dead ends: 185 [2018-12-03 15:25:25,300 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 15:25:25,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 15:25:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 15:25:25,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-03 15:25:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 15:25:25,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2018-12-03 15:25:25,305 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 168 [2018-12-03 15:25:25,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:25,306 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2018-12-03 15:25:25,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 15:25:25,306 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2018-12-03 15:25:25,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 15:25:25,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:25,306 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:25:25,307 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:25,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:25,307 INFO L82 PathProgramCache]: Analyzing trace with hash -799880032, now seen corresponding path program 76 times [2018-12-03 15:25:25,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:25,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:25,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:25:25,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:25,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6024 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:27,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:27,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:27,517 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:27,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:27,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:27,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:27,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:25:27,525 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:25:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:27,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6024 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:27,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6024 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:34,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:34,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 15:25:34,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:34,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 15:25:34,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 15:25:34,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:25:34,379 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 80 states. [2018-12-03 15:25:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:34,560 INFO L93 Difference]: Finished difference Result 187 states and 191 transitions. [2018-12-03 15:25:34,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 15:25:34,560 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 170 [2018-12-03 15:25:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:34,561 INFO L225 Difference]: With dead ends: 187 [2018-12-03 15:25:34,561 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 15:25:34,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:25:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 15:25:34,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-12-03 15:25:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-03 15:25:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 175 transitions. [2018-12-03 15:25:34,570 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 175 transitions. Word has length 170 [2018-12-03 15:25:34,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:34,570 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 175 transitions. [2018-12-03 15:25:34,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 15:25:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2018-12-03 15:25:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-03 15:25:34,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:34,571 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:25:34,571 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:34,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:34,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1721269404, now seen corresponding path program 77 times [2018-12-03 15:25:34,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:34,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:34,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:25:34,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:34,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:37,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:37,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:37,047 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:37,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:37,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:37,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:37,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:25:37,056 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:25:37,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 79 check-sat command(s) [2018-12-03 15:25:37,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:37,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:37,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:44,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:44,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 15:25:44,146 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:44,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 15:25:44,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 15:25:44,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 15:25:44,148 INFO L87 Difference]: Start difference. First operand 173 states and 175 transitions. Second operand 81 states. [2018-12-03 15:25:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:44,329 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2018-12-03 15:25:44,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 15:25:44,330 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 172 [2018-12-03 15:25:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:44,331 INFO L225 Difference]: With dead ends: 189 [2018-12-03 15:25:44,331 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 15:25:44,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 15:25:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 15:25:44,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-03 15:25:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 15:25:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2018-12-03 15:25:44,340 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 172 [2018-12-03 15:25:44,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:44,340 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2018-12-03 15:25:44,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 15:25:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2018-12-03 15:25:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 15:25:44,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:44,341 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:25:44,341 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:44,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:44,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2110644840, now seen corresponding path program 78 times [2018-12-03 15:25:44,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:44,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:44,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:25:44,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:44,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6338 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:47,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:47,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:47,025 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:47,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:47,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:47,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:47,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:25:47,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:25:47,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:25:47,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:47,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:47,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6338 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:47,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6338 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:54,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:54,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 15:25:54,104 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:54,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 15:25:54,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 15:25:54,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 15:25:54,106 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 82 states. [2018-12-03 15:25:54,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:54,359 INFO L93 Difference]: Finished difference Result 191 states and 195 transitions. [2018-12-03 15:25:54,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 15:25:54,359 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 174 [2018-12-03 15:25:54,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:54,361 INFO L225 Difference]: With dead ends: 191 [2018-12-03 15:25:54,361 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 15:25:54,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 15:25:54,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 15:25:54,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-12-03 15:25:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 15:25:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 179 transitions. [2018-12-03 15:25:54,367 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 179 transitions. Word has length 174 [2018-12-03 15:25:54,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:54,367 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 179 transitions. [2018-12-03 15:25:54,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 15:25:54,367 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 179 transitions. [2018-12-03 15:25:54,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 15:25:54,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:54,368 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:25:54,368 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:54,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:54,368 INFO L82 PathProgramCache]: Analyzing trace with hash 501706644, now seen corresponding path program 79 times [2018-12-03 15:25:54,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:54,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:54,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:25:54,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:54,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:57,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:57,077 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:57,078 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:57,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:57,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:57,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:57,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:25:57,086 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:25:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:57,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:25:57,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:04,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:04,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 15:26:04,442 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:04,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 15:26:04,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 15:26:04,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 15:26:04,444 INFO L87 Difference]: Start difference. First operand 177 states and 179 transitions. Second operand 83 states. [2018-12-03 15:26:04,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:04,631 INFO L93 Difference]: Finished difference Result 193 states and 197 transitions. [2018-12-03 15:26:04,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 15:26:04,631 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 176 [2018-12-03 15:26:04,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:04,633 INFO L225 Difference]: With dead ends: 193 [2018-12-03 15:26:04,633 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 15:26:04,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 15:26:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 15:26:04,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-12-03 15:26:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-03 15:26:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 181 transitions. [2018-12-03 15:26:04,640 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 181 transitions. Word has length 176 [2018-12-03 15:26:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:04,640 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 181 transitions. [2018-12-03 15:26:04,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 15:26:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 181 transitions. [2018-12-03 15:26:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-03 15:26:04,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:04,641 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:26:04,641 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:04,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:04,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1584385392, now seen corresponding path program 80 times [2018-12-03 15:26:04,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:04,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:04,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:04,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:04,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6660 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:07,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:07,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:07,493 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:07,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:07,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:07,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:26:07,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:26:07,502 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:26:07,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-12-03 15:26:07,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:07,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6660 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:07,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6660 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:15,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:15,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 15:26:15,142 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:15,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 15:26:15,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 15:26:15,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 15:26:15,144 INFO L87 Difference]: Start difference. First operand 179 states and 181 transitions. Second operand 84 states. [2018-12-03 15:26:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:15,312 INFO L93 Difference]: Finished difference Result 195 states and 199 transitions. [2018-12-03 15:26:15,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 15:26:15,312 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 178 [2018-12-03 15:26:15,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:15,313 INFO L225 Difference]: With dead ends: 195 [2018-12-03 15:26:15,313 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 15:26:15,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 15:26:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 15:26:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-03 15:26:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-03 15:26:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 183 transitions. [2018-12-03 15:26:15,321 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 183 transitions. Word has length 178 [2018-12-03 15:26:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:15,321 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 183 transitions. [2018-12-03 15:26:15,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 15:26:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 183 transitions. [2018-12-03 15:26:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 15:26:15,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:15,322 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:26:15,322 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:15,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:15,322 INFO L82 PathProgramCache]: Analyzing trace with hash -569104756, now seen corresponding path program 81 times [2018-12-03 15:26:15,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:15,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:15,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:15,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:15,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6824 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:18,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:18,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:18,081 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:18,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:18,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:18,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:26:18,091 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:26:18,091 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:26:18,219 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:26:18,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:18,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6824 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:18,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6824 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:25,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:25,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 15:26:25,589 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:25,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 15:26:25,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 15:26:25,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 15:26:25,591 INFO L87 Difference]: Start difference. First operand 181 states and 183 transitions. Second operand 85 states. [2018-12-03 15:26:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:25,908 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2018-12-03 15:26:25,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 15:26:25,908 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 180 [2018-12-03 15:26:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:25,909 INFO L225 Difference]: With dead ends: 197 [2018-12-03 15:26:25,909 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 15:26:25,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 15:26:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 15:26:25,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-12-03 15:26:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-03 15:26:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 185 transitions. [2018-12-03 15:26:25,918 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 185 transitions. Word has length 180 [2018-12-03 15:26:25,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:25,918 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 185 transitions. [2018-12-03 15:26:25,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 15:26:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 185 transitions. [2018-12-03 15:26:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-03 15:26:25,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:25,919 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:26:25,919 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:25,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:25,920 INFO L82 PathProgramCache]: Analyzing trace with hash 158010248, now seen corresponding path program 82 times [2018-12-03 15:26:25,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:25,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:25,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:25,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:25,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6990 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:28,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:28,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:28,637 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:28,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:28,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:28,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:26:28,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:28,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:26:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:28,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6990 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:28,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6990 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:36,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:36,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 15:26:36,967 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:36,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 15:26:36,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 15:26:36,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:26:36,969 INFO L87 Difference]: Start difference. First operand 183 states and 185 transitions. Second operand 86 states. [2018-12-03 15:26:37,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:37,154 INFO L93 Difference]: Finished difference Result 199 states and 203 transitions. [2018-12-03 15:26:37,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 15:26:37,155 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 182 [2018-12-03 15:26:37,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:37,157 INFO L225 Difference]: With dead ends: 199 [2018-12-03 15:26:37,157 INFO L226 Difference]: Without dead ends: 185 [2018-12-03 15:26:37,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:26:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-03 15:26:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-12-03 15:26:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-03 15:26:37,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2018-12-03 15:26:37,165 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 182 [2018-12-03 15:26:37,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:37,166 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2018-12-03 15:26:37,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 15:26:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2018-12-03 15:26:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-03 15:26:37,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:37,167 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:26:37,167 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:37,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:37,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1164140156, now seen corresponding path program 83 times [2018-12-03 15:26:37,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:37,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:37,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:37,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:37,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7158 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:39,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:39,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:39,835 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:39,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:39,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:39,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:26:39,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:26:39,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:26:40,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 85 check-sat command(s) [2018-12-03 15:26:40,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:40,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7158 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:40,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7158 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:48,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:48,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 15:26:48,195 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:48,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 15:26:48,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 15:26:48,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 15:26:48,197 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 87 states. [2018-12-03 15:26:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:48,378 INFO L93 Difference]: Finished difference Result 201 states and 205 transitions. [2018-12-03 15:26:48,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 15:26:48,379 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 184 [2018-12-03 15:26:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:48,380 INFO L225 Difference]: With dead ends: 201 [2018-12-03 15:26:48,380 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 15:26:48,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 15:26:48,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 15:26:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-03 15:26:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-03 15:26:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 189 transitions. [2018-12-03 15:26:48,390 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 189 transitions. Word has length 184 [2018-12-03 15:26:48,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:48,390 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 189 transitions. [2018-12-03 15:26:48,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 15:26:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 189 transitions. [2018-12-03 15:26:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-03 15:26:48,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:48,391 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:26:48,391 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:48,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:48,392 INFO L82 PathProgramCache]: Analyzing trace with hash -440358784, now seen corresponding path program 84 times [2018-12-03 15:26:48,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:48,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:48,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:48,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:48,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7328 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:51,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:51,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:51,091 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:51,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:51,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:51,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:26:51,099 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:26:51,100 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:26:51,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:26:51,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:51,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7328 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:51,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7328 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:26:59,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:59,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 15:26:59,525 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:59,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 15:26:59,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 15:26:59,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 15:26:59,527 INFO L87 Difference]: Start difference. First operand 187 states and 189 transitions. Second operand 88 states. [2018-12-03 15:26:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:59,742 INFO L93 Difference]: Finished difference Result 203 states and 207 transitions. [2018-12-03 15:26:59,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 15:26:59,742 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 186 [2018-12-03 15:26:59,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:59,743 INFO L225 Difference]: With dead ends: 203 [2018-12-03 15:26:59,743 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 15:26:59,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 15:26:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 15:26:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-12-03 15:26:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 15:26:59,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 191 transitions. [2018-12-03 15:26:59,753 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 191 transitions. Word has length 186 [2018-12-03 15:26:59,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:59,753 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 191 transitions. [2018-12-03 15:26:59,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 15:26:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 191 transitions. [2018-12-03 15:26:59,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 15:26:59,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:59,754 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:26:59,754 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:59,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:59,754 INFO L82 PathProgramCache]: Analyzing trace with hash -671162244, now seen corresponding path program 85 times [2018-12-03 15:26:59,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:59,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:59,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:59,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:59,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7500 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:27:02,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:02,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:02,773 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:02,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:02,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:02,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:27:02,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:02,782 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:27:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:02,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7500 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:27:02,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7500 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:27:11,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:11,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 15:27:11,120 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:11,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 15:27:11,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 15:27:11,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 15:27:11,122 INFO L87 Difference]: Start difference. First operand 189 states and 191 transitions. Second operand 89 states. [2018-12-03 15:27:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:11,298 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2018-12-03 15:27:11,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 15:27:11,299 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 188 [2018-12-03 15:27:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:11,300 INFO L225 Difference]: With dead ends: 205 [2018-12-03 15:27:11,300 INFO L226 Difference]: Without dead ends: 191 [2018-12-03 15:27:11,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 15:27:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-03 15:27:11,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-12-03 15:27:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-03 15:27:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 193 transitions. [2018-12-03 15:27:11,309 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 193 transitions. Word has length 188 [2018-12-03 15:27:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:11,309 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 193 transitions. [2018-12-03 15:27:11,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 15:27:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 193 transitions. [2018-12-03 15:27:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-03 15:27:11,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:11,310 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:27:11,311 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:11,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:11,311 INFO L82 PathProgramCache]: Analyzing trace with hash 865012088, now seen corresponding path program 86 times [2018-12-03 15:27:11,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:11,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:11,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:11,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:11,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7674 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:27:14,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:14,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:14,442 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:14,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:14,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:14,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:27:14,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:27:14,452 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:27:14,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-12-03 15:27:14,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:14,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7674 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:27:14,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7674 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:27:23,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:23,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 15:27:23,413 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:23,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 15:27:23,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 15:27:23,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 15:27:23,414 INFO L87 Difference]: Start difference. First operand 191 states and 193 transitions. Second operand 90 states. [2018-12-03 15:27:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:23,693 INFO L93 Difference]: Finished difference Result 207 states and 211 transitions. [2018-12-03 15:27:23,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 15:27:23,694 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 190 [2018-12-03 15:27:23,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:23,694 INFO L225 Difference]: With dead ends: 207 [2018-12-03 15:27:23,694 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 15:27:23,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 15:27:23,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 15:27:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-12-03 15:27:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-03 15:27:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 195 transitions. [2018-12-03 15:27:23,701 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 195 transitions. Word has length 190 [2018-12-03 15:27:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:23,701 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 195 transitions. [2018-12-03 15:27:23,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 15:27:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 195 transitions. [2018-12-03 15:27:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-03 15:27:23,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:23,702 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:27:23,702 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:23,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:23,702 INFO L82 PathProgramCache]: Analyzing trace with hash -340204684, now seen corresponding path program 87 times [2018-12-03 15:27:23,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:23,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:23,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:23,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:23,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7850 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:27:26,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:26,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:26,698 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:26,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:26,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:26,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:27:26,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:27:26,707 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:27:26,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:27:26,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:26,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7850 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:27:26,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 7850 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:27:35,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:35,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 15:27:35,627 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:35,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 15:27:35,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 15:27:35,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 15:27:35,629 INFO L87 Difference]: Start difference. First operand 193 states and 195 transitions. Second operand 91 states. [2018-12-03 15:27:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:35,960 INFO L93 Difference]: Finished difference Result 209 states and 213 transitions. [2018-12-03 15:27:35,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 15:27:35,961 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 192 [2018-12-03 15:27:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:35,962 INFO L225 Difference]: With dead ends: 209 [2018-12-03 15:27:35,962 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 15:27:35,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 15:27:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 15:27:35,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-12-03 15:27:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-03 15:27:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2018-12-03 15:27:35,968 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 192 [2018-12-03 15:27:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:35,968 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2018-12-03 15:27:35,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 15:27:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2018-12-03 15:27:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-03 15:27:35,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:35,969 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:27:35,969 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:35,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:35,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1087647344, now seen corresponding path program 88 times [2018-12-03 15:27:35,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:35,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:35,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:35,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:35,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8028 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:27:39,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:39,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:39,277 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:39,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:39,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:39,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:27:39,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:39,288 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:27:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:39,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8028 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:27:39,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8028 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:27:48,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:48,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 15:27:48,480 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:48,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 15:27:48,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 15:27:48,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:27:48,482 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand 92 states. [2018-12-03 15:27:48,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:48,815 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2018-12-03 15:27:48,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 15:27:48,815 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 194 [2018-12-03 15:27:48,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:48,816 INFO L225 Difference]: With dead ends: 211 [2018-12-03 15:27:48,816 INFO L226 Difference]: Without dead ends: 197 [2018-12-03 15:27:48,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:27:48,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-03 15:27:48,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-12-03 15:27:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-03 15:27:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 199 transitions. [2018-12-03 15:27:48,823 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 199 transitions. Word has length 194 [2018-12-03 15:27:48,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:48,823 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 199 transitions. [2018-12-03 15:27:48,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 15:27:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 199 transitions. [2018-12-03 15:27:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-03 15:27:48,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:48,824 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:27:48,825 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:48,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1136088468, now seen corresponding path program 89 times [2018-12-03 15:27:48,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:48,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:48,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:48,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:48,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:27:51,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:51,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:51,876 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:51,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:51,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:51,877 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:27:51,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:27:51,887 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:27:52,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 91 check-sat command(s) [2018-12-03 15:27:52,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:52,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:27:52,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:28:01,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:01,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 15:28:01,472 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:01,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 15:28:01,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 15:28:01,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 15:28:01,474 INFO L87 Difference]: Start difference. First operand 197 states and 199 transitions. Second operand 93 states. [2018-12-03 15:28:01,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:01,706 INFO L93 Difference]: Finished difference Result 213 states and 217 transitions. [2018-12-03 15:28:01,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 15:28:01,706 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 196 [2018-12-03 15:28:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:01,707 INFO L225 Difference]: With dead ends: 213 [2018-12-03 15:28:01,708 INFO L226 Difference]: Without dead ends: 199 [2018-12-03 15:28:01,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 15:28:01,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-03 15:28:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-12-03 15:28:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-03 15:28:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2018-12-03 15:28:01,714 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 196 [2018-12-03 15:28:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:01,715 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2018-12-03 15:28:01,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 15:28:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2018-12-03 15:28:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-03 15:28:01,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:01,715 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:28:01,716 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:01,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash 747509608, now seen corresponding path program 90 times [2018-12-03 15:28:01,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:01,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:01,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:28:01,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:01,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8390 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:28:05,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:05,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:05,114 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:05,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:05,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:05,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:28:05,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:28:05,123 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:28:05,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:28:05,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:28:05,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 8390 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:28:05,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8390 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:28:14,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:14,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 15:28:14,716 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:14,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 15:28:14,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 15:28:14,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 15:28:14,718 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 94 states. [2018-12-03 15:28:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:14,968 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2018-12-03 15:28:14,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 15:28:14,968 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 198 [2018-12-03 15:28:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:14,970 INFO L225 Difference]: With dead ends: 215 [2018-12-03 15:28:14,970 INFO L226 Difference]: Without dead ends: 201 [2018-12-03 15:28:14,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 15:28:14,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-03 15:28:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-12-03 15:28:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-03 15:28:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 203 transitions. [2018-12-03 15:28:14,977 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 203 transitions. Word has length 198 [2018-12-03 15:28:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:14,977 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 203 transitions. [2018-12-03 15:28:14,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 15:28:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 203 transitions. [2018-12-03 15:28:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-03 15:28:14,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:14,978 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:28:14,978 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:14,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:14,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1590938268, now seen corresponding path program 91 times [2018-12-03 15:28:14,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:14,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:14,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:28:14,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:14,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8574 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:28:18,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:18,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:18,093 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:18,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:18,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:18,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:28:18,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:28:18,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:28:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:18,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8574 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:28:18,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:28,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8574 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:28:28,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:28,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 15:28:28,050 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:28,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 15:28:28,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 15:28:28,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 15:28:28,052 INFO L87 Difference]: Start difference. First operand 201 states and 203 transitions. Second operand 95 states. [2018-12-03 15:28:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:28,394 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2018-12-03 15:28:28,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 15:28:28,394 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 200 [2018-12-03 15:28:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:28,396 INFO L225 Difference]: With dead ends: 217 [2018-12-03 15:28:28,396 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 15:28:28,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 15:28:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 15:28:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-12-03 15:28:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 15:28:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2018-12-03 15:28:28,402 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 200 [2018-12-03 15:28:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:28,402 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2018-12-03 15:28:28,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 15:28:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2018-12-03 15:28:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-03 15:28:28,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:28,403 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:28:28,403 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:28,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:28,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1723516000, now seen corresponding path program 92 times [2018-12-03 15:28:28,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:28,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:28,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:28:28,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:28,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8760 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:28:31,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:31,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:31,916 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:31,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:31,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:31,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:28:31,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:28:31,927 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:28:32,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2018-12-03 15:28:32,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:28:32,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8760 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:28:32,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8760 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:28:42,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:42,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 15:28:42,012 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:42,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 15:28:42,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 15:28:42,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 15:28:42,014 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 96 states. [2018-12-03 15:28:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:42,399 INFO L93 Difference]: Finished difference Result 219 states and 223 transitions. [2018-12-03 15:28:42,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 15:28:42,400 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 202 [2018-12-03 15:28:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:42,400 INFO L225 Difference]: With dead ends: 219 [2018-12-03 15:28:42,401 INFO L226 Difference]: Without dead ends: 205 [2018-12-03 15:28:42,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 15:28:42,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-03 15:28:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-12-03 15:28:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-03 15:28:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 207 transitions. [2018-12-03 15:28:42,407 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 207 transitions. Word has length 202 [2018-12-03 15:28:42,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:42,407 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 207 transitions. [2018-12-03 15:28:42,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 15:28:42,408 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 207 transitions. [2018-12-03 15:28:42,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 15:28:42,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:42,408 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:28:42,408 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:42,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:42,409 INFO L82 PathProgramCache]: Analyzing trace with hash 48333916, now seen corresponding path program 93 times [2018-12-03 15:28:42,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:42,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:42,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:28:42,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:42,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8948 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:28:45,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:45,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:45,907 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:45,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:45,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:45,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:28:45,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:28:45,916 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:28:46,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:28:46,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:28:46,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8948 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:28:46,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8948 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:28:56,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:56,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 15:28:56,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:56,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 15:28:56,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 15:28:56,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 15:28:56,042 INFO L87 Difference]: Start difference. First operand 205 states and 207 transitions. Second operand 97 states. [2018-12-03 15:28:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:56,296 INFO L93 Difference]: Finished difference Result 221 states and 225 transitions. [2018-12-03 15:28:56,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 15:28:56,296 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 204 [2018-12-03 15:28:56,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:56,297 INFO L225 Difference]: With dead ends: 221 [2018-12-03 15:28:56,297 INFO L226 Difference]: Without dead ends: 207 [2018-12-03 15:28:56,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 15:28:56,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-03 15:28:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-12-03 15:28:56,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 15:28:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 209 transitions. [2018-12-03 15:28:56,304 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 209 transitions. Word has length 204 [2018-12-03 15:28:56,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:56,304 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 209 transitions. [2018-12-03 15:28:56,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 15:28:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 209 transitions. [2018-12-03 15:28:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-03 15:28:56,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:56,305 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:28:56,306 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:56,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:56,306 INFO L82 PathProgramCache]: Analyzing trace with hash 811087192, now seen corresponding path program 94 times [2018-12-03 15:28:56,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:56,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:56,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:28:56,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:56,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9138 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:28:59,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:59,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:59,853 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:59,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:59,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:59,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:28:59,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:28:59,879 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:29:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:00,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9138 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:29:00,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 9138 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:29:10,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:10,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 15:29:10,139 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:10,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 15:29:10,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 15:29:10,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 15:29:10,142 INFO L87 Difference]: Start difference. First operand 207 states and 209 transitions. Second operand 98 states. [2018-12-03 15:29:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:10,428 INFO L93 Difference]: Finished difference Result 223 states and 227 transitions. [2018-12-03 15:29:10,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 15:29:10,428 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 206 [2018-12-03 15:29:10,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:10,430 INFO L225 Difference]: With dead ends: 223 [2018-12-03 15:29:10,430 INFO L226 Difference]: Without dead ends: 209 [2018-12-03 15:29:10,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 15:29:10,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-03 15:29:10,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-12-03 15:29:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-03 15:29:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 211 transitions. [2018-12-03 15:29:10,437 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 211 transitions. Word has length 206 [2018-12-03 15:29:10,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:10,437 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 211 transitions. [2018-12-03 15:29:10,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 15:29:10,438 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 211 transitions. [2018-12-03 15:29:10,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-03 15:29:10,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:10,438 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:29:10,439 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:10,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:10,439 INFO L82 PathProgramCache]: Analyzing trace with hash -622422188, now seen corresponding path program 95 times [2018-12-03 15:29:10,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:10,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:10,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:29:10,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:10,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9330 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:29:13,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:13,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:13,942 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:13,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:13,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:13,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:29:13,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:29:13,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:29:14,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 97 check-sat command(s) [2018-12-03 15:29:14,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:29:14,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9330 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:29:14,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9330 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:29:24,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:24,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 15:29:24,761 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:24,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 15:29:24,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 15:29:24,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 15:29:24,764 INFO L87 Difference]: Start difference. First operand 209 states and 211 transitions. Second operand 99 states. [2018-12-03 15:29:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:25,235 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2018-12-03 15:29:25,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 15:29:25,235 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 208 [2018-12-03 15:29:25,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:25,237 INFO L225 Difference]: With dead ends: 225 [2018-12-03 15:29:25,237 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 15:29:25,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 15:29:25,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 15:29:25,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-03 15:29:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-03 15:29:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 213 transitions. [2018-12-03 15:29:25,244 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 213 transitions. Word has length 208 [2018-12-03 15:29:25,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:25,244 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 213 transitions. [2018-12-03 15:29:25,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 15:29:25,244 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 213 transitions. [2018-12-03 15:29:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-03 15:29:25,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:25,245 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:29:25,245 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:25,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:25,246 INFO L82 PathProgramCache]: Analyzing trace with hash 459565648, now seen corresponding path program 96 times [2018-12-03 15:29:25,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:25,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:25,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:29:25,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:25,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9524 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:29:28,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:28,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:28,804 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:28,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:28,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:28,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:29:28,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:29:28,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:29:28,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:29:28,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:29:28,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9524 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:29:28,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9524 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:29:39,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:39,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 15:29:39,506 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:39,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 15:29:39,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 15:29:39,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 15:29:39,508 INFO L87 Difference]: Start difference. First operand 211 states and 213 transitions. Second operand 100 states. [2018-12-03 15:29:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:39,937 INFO L93 Difference]: Finished difference Result 227 states and 231 transitions. [2018-12-03 15:29:39,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 15:29:39,938 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 210 [2018-12-03 15:29:39,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:39,938 INFO L225 Difference]: With dead ends: 227 [2018-12-03 15:29:39,939 INFO L226 Difference]: Without dead ends: 213 [2018-12-03 15:29:39,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 15:29:39,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-03 15:29:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-12-03 15:29:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 15:29:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2018-12-03 15:29:39,946 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 210 [2018-12-03 15:29:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:39,946 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2018-12-03 15:29:39,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 15:29:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2018-12-03 15:29:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-03 15:29:39,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:39,947 INFO L402 BasicCegarLoop]: trace histogram [99, 98, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:29:39,947 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:39,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:39,947 INFO L82 PathProgramCache]: Analyzing trace with hash 867790412, now seen corresponding path program 97 times [2018-12-03 15:29:39,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:39,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:39,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:29:39,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:39,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:29:43,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:43,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:43,860 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:43,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:43,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:43,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:29:43,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:29:43,868 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:29:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:44,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:29:44,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:29:54,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:54,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 15:29:54,667 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:54,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 15:29:54,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 15:29:54,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 15:29:54,670 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 101 states. [2018-12-03 15:29:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:55,039 INFO L93 Difference]: Finished difference Result 229 states and 233 transitions. [2018-12-03 15:29:55,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 15:29:55,041 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 212 [2018-12-03 15:29:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:55,042 INFO L225 Difference]: With dead ends: 229 [2018-12-03 15:29:55,043 INFO L226 Difference]: Without dead ends: 215 [2018-12-03 15:29:55,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 15:29:55,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-03 15:29:55,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-12-03 15:29:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-12-03 15:29:55,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 217 transitions. [2018-12-03 15:29:55,053 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 217 transitions. Word has length 212 [2018-12-03 15:29:55,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:55,053 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 217 transitions. [2018-12-03 15:29:55,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 15:29:55,053 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 217 transitions. [2018-12-03 15:29:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-12-03 15:29:55,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:55,054 INFO L402 BasicCegarLoop]: trace histogram [100, 99, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:29:55,054 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:55,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:55,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1965202616, now seen corresponding path program 98 times [2018-12-03 15:29:55,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:55,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:55,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:29:55,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:55,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9918 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:29:58,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:58,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:58,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:58,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:58,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:58,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:29:58,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:29:58,994 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:29:59,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2018-12-03 15:29:59,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:29:59,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 9918 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:29:59,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:30:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9918 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:30:10,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:30:10,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 15:30:10,253 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:30:10,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 15:30:10,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 15:30:10,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 15:30:10,256 INFO L87 Difference]: Start difference. First operand 215 states and 217 transitions. Second operand 102 states. [2018-12-03 15:30:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:30:10,601 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2018-12-03 15:30:10,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 15:30:10,602 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 214 [2018-12-03 15:30:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:30:10,603 INFO L225 Difference]: With dead ends: 231 [2018-12-03 15:30:10,603 INFO L226 Difference]: Without dead ends: 217 [2018-12-03 15:30:10,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 15:30:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-03 15:30:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-12-03 15:30:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-03 15:30:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2018-12-03 15:30:10,614 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 214 [2018-12-03 15:30:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:30:10,615 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2018-12-03 15:30:10,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 15:30:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2018-12-03 15:30:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-03 15:30:10,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:30:10,616 INFO L402 BasicCegarLoop]: trace histogram [101, 100, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:30:10,616 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:30:10,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:30:10,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1462236860, now seen corresponding path program 99 times [2018-12-03 15:30:10,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:30:10,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:10,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:30:10,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:10,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:30:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10118 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:30:14,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:14,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:30:14,828 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:30:14,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:30:14,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:14,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:30:14,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:30:14,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:30:14,974 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:30:14,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:30:14,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:30:15,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10118 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:30:15,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:30:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10118 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:30:26,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:30:26,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 15:30:26,399 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:30:26,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 15:30:26,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 15:30:26,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 15:30:26,401 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 103 states. [2018-12-03 15:30:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:30:26,740 INFO L93 Difference]: Finished difference Result 233 states and 237 transitions. [2018-12-03 15:30:26,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 15:30:26,741 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 216 [2018-12-03 15:30:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:30:26,741 INFO L225 Difference]: With dead ends: 233 [2018-12-03 15:30:26,741 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 15:30:26,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 15:30:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 15:30:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-12-03 15:30:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-12-03 15:30:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 221 transitions. [2018-12-03 15:30:26,752 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 221 transitions. Word has length 216 [2018-12-03 15:30:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:30:26,752 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 221 transitions. [2018-12-03 15:30:26,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 15:30:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 221 transitions. [2018-12-03 15:30:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-03 15:30:26,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:30:26,754 INFO L402 BasicCegarLoop]: trace histogram [102, 101, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:30:26,754 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:30:26,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:30:26,754 INFO L82 PathProgramCache]: Analyzing trace with hash 851517504, now seen corresponding path program 100 times [2018-12-03 15:30:26,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:30:26,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:26,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:30:26,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:26,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:30:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10320 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:30:30,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:30,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:30:30,603 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:30:30,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:30:30,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:30,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:30:30,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:30:30,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:30:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:30,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:30:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10320 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:30:30,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:30:42,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10320 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:30:42,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:30:42,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 15:30:42,497 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:30:42,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 15:30:42,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 15:30:42,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 15:30:42,500 INFO L87 Difference]: Start difference. First operand 219 states and 221 transitions. Second operand 104 states. [2018-12-03 15:30:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:30:42,969 INFO L93 Difference]: Finished difference Result 235 states and 239 transitions. [2018-12-03 15:30:42,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 15:30:42,969 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 218 [2018-12-03 15:30:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:30:42,970 INFO L225 Difference]: With dead ends: 235 [2018-12-03 15:30:42,970 INFO L226 Difference]: Without dead ends: 221 [2018-12-03 15:30:42,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 15:30:42,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-12-03 15:30:42,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-12-03 15:30:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-12-03 15:30:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 223 transitions. [2018-12-03 15:30:42,977 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 223 transitions. Word has length 218 [2018-12-03 15:30:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:30:42,977 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 223 transitions. [2018-12-03 15:30:42,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 15:30:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 223 transitions. [2018-12-03 15:30:42,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-03 15:30:42,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:30:42,979 INFO L402 BasicCegarLoop]: trace histogram [103, 102, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:30:42,979 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:30:42,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:30:42,979 INFO L82 PathProgramCache]: Analyzing trace with hash -423598020, now seen corresponding path program 101 times [2018-12-03 15:30:42,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:30:42,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:42,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:30:42,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:42,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:30:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10524 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:30:46,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:46,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:30:46,906 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:30:46,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:30:46,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:46,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:30:46,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:30:46,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:30:47,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 103 check-sat command(s) [2018-12-03 15:30:47,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:30:47,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:30:47,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10524 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:30:47,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:30:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10524 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:30:59,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:30:59,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 15:30:59,004 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:30:59,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 15:30:59,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 15:30:59,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 15:30:59,006 INFO L87 Difference]: Start difference. First operand 221 states and 223 transitions. Second operand 105 states. [2018-12-03 15:30:59,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:30:59,430 INFO L93 Difference]: Finished difference Result 237 states and 241 transitions. [2018-12-03 15:30:59,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 15:30:59,430 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 220 [2018-12-03 15:30:59,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:30:59,431 INFO L225 Difference]: With dead ends: 237 [2018-12-03 15:30:59,431 INFO L226 Difference]: Without dead ends: 223 [2018-12-03 15:30:59,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 15:30:59,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-12-03 15:30:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-12-03 15:30:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-12-03 15:30:59,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 225 transitions. [2018-12-03 15:30:59,442 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 225 transitions. Word has length 220 [2018-12-03 15:30:59,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:30:59,443 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 225 transitions. [2018-12-03 15:30:59,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 15:30:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 225 transitions. [2018-12-03 15:30:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-03 15:30:59,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:30:59,444 INFO L402 BasicCegarLoop]: trace histogram [104, 103, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:30:59,444 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:30:59,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:30:59,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1743937224, now seen corresponding path program 102 times [2018-12-03 15:30:59,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:30:59,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:59,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:30:59,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:59,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:30:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10730 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:31:03,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:03,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:31:03,662 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:31:03,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:31:03,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:03,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:31:03,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:31:03,670 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:31:03,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:31:03,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:31:03,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:31:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10730 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:31:03,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:31:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10730 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:31:15,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:31:15,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 15:31:15,681 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:31:15,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 15:31:15,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 15:31:15,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 15:31:15,683 INFO L87 Difference]: Start difference. First operand 223 states and 225 transitions. Second operand 106 states. [2018-12-03 15:31:16,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:31:16,128 INFO L93 Difference]: Finished difference Result 239 states and 243 transitions. [2018-12-03 15:31:16,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 15:31:16,128 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 222 [2018-12-03 15:31:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:31:16,129 INFO L225 Difference]: With dead ends: 239 [2018-12-03 15:31:16,129 INFO L226 Difference]: Without dead ends: 225 [2018-12-03 15:31:16,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 15:31:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-12-03 15:31:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-12-03 15:31:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-12-03 15:31:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 227 transitions. [2018-12-03 15:31:16,139 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 227 transitions. Word has length 222 [2018-12-03 15:31:16,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:31:16,139 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 227 transitions. [2018-12-03 15:31:16,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 15:31:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 227 transitions. [2018-12-03 15:31:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-03 15:31:16,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:31:16,140 INFO L402 BasicCegarLoop]: trace histogram [105, 104, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:31:16,141 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:31:16,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:31:16,141 INFO L82 PathProgramCache]: Analyzing trace with hash 720407348, now seen corresponding path program 103 times [2018-12-03 15:31:16,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:31:16,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:16,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:31:16,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:16,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:31:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10938 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:31:20,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:20,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:31:20,381 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:31:20,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:31:20,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:20,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:31:20,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:31:20,391 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:31:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:20,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:31:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10938 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:31:20,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:31:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10938 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:31:32,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:31:32,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 15:31:32,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:31:32,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 15:31:32,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 15:31:32,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 15:31:32,739 INFO L87 Difference]: Start difference. First operand 225 states and 227 transitions. Second operand 107 states. [2018-12-03 15:31:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:31:33,362 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2018-12-03 15:31:33,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 15:31:33,368 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 224 [2018-12-03 15:31:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:31:33,369 INFO L225 Difference]: With dead ends: 241 [2018-12-03 15:31:33,369 INFO L226 Difference]: Without dead ends: 227 [2018-12-03 15:31:33,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 15:31:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-03 15:31:33,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-12-03 15:31:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-03 15:31:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2018-12-03 15:31:33,381 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 224 [2018-12-03 15:31:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:31:33,381 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2018-12-03 15:31:33,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 15:31:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2018-12-03 15:31:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-03 15:31:33,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:31:33,382 INFO L402 BasicCegarLoop]: trace histogram [106, 105, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:31:33,382 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:31:33,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:31:33,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1866406352, now seen corresponding path program 104 times [2018-12-03 15:31:33,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:31:33,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:33,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:31:33,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:33,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:31:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 11148 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:31:37,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:37,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:31:37,518 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:31:37,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:31:37,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:37,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:31:37,527 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:31:37,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:31:37,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 106 check-sat command(s) [2018-12-03 15:31:37,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:31:37,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:31:37,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11148 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:31:37,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:31:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 11148 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:31:50,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:31:50,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 15:31:50,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:31:50,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 15:31:50,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 15:31:50,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 15:31:50,602 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 108 states. [2018-12-03 15:31:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:31:51,031 INFO L93 Difference]: Finished difference Result 243 states and 247 transitions. [2018-12-03 15:31:51,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 15:31:51,031 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 226 [2018-12-03 15:31:51,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:31:51,032 INFO L225 Difference]: With dead ends: 243 [2018-12-03 15:31:51,032 INFO L226 Difference]: Without dead ends: 229 [2018-12-03 15:31:51,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 15:31:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-03 15:31:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-12-03 15:31:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-03 15:31:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 231 transitions. [2018-12-03 15:31:51,039 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 231 transitions. Word has length 226 [2018-12-03 15:31:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:31:51,039 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 231 transitions. [2018-12-03 15:31:51,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 15:31:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 231 transitions. [2018-12-03 15:31:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-03 15:31:51,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:31:51,040 INFO L402 BasicCegarLoop]: trace histogram [107, 106, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:31:51,040 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:31:51,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:31:51,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1008307668, now seen corresponding path program 105 times [2018-12-03 15:31:51,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:31:51,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:51,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:31:51,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:51,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:31:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 11360 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:31:55,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:55,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:31:55,467 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:31:55,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:31:55,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:55,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:31:55,475 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:31:55,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:31:55,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:31:55,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:31:55,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:31:55,694 INFO L134 CoverageAnalysis]: Checked inductivity of 11360 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:31:55,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:32:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 11360 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:32:08,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:32:08,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 15:32:08,232 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:32:08,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 15:32:08,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 15:32:08,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 15:32:08,235 INFO L87 Difference]: Start difference. First operand 229 states and 231 transitions. Second operand 109 states. [2018-12-03 15:32:08,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:32:08,788 INFO L93 Difference]: Finished difference Result 245 states and 249 transitions. [2018-12-03 15:32:08,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 15:32:08,789 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 228 [2018-12-03 15:32:08,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:32:08,790 INFO L225 Difference]: With dead ends: 245 [2018-12-03 15:32:08,790 INFO L226 Difference]: Without dead ends: 231 [2018-12-03 15:32:08,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 15:32:08,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-03 15:32:08,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-12-03 15:32:08,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-03 15:32:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2018-12-03 15:32:08,799 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 228 [2018-12-03 15:32:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:32:08,799 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2018-12-03 15:32:08,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 15:32:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2018-12-03 15:32:08,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-12-03 15:32:08,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:32:08,800 INFO L402 BasicCegarLoop]: trace histogram [108, 107, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:32:08,800 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:32:08,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:32:08,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1009193176, now seen corresponding path program 106 times [2018-12-03 15:32:08,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:32:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:08,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:32:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:08,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:32:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 11574 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:32:13,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:13,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:32:13,293 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:32:13,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:32:13,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:13,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:32:13,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:32:13,301 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:32:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:13,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:32:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11574 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:32:13,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:32:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11574 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:32:26,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:32:26,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 15:32:26,321 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:32:26,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 15:32:26,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 15:32:26,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 15:32:26,323 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 110 states. [2018-12-03 15:32:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:32:26,733 INFO L93 Difference]: Finished difference Result 247 states and 251 transitions. [2018-12-03 15:32:26,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 15:32:26,734 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 230 [2018-12-03 15:32:26,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:32:26,734 INFO L225 Difference]: With dead ends: 247 [2018-12-03 15:32:26,734 INFO L226 Difference]: Without dead ends: 233 [2018-12-03 15:32:26,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 15:32:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-12-03 15:32:26,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-12-03 15:32:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-12-03 15:32:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 235 transitions. [2018-12-03 15:32:26,741 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 235 transitions. Word has length 230 [2018-12-03 15:32:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:32:26,742 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 235 transitions. [2018-12-03 15:32:26,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 15:32:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 235 transitions. [2018-12-03 15:32:26,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-03 15:32:26,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:32:26,743 INFO L402 BasicCegarLoop]: trace histogram [109, 108, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:32:26,743 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:32:26,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:32:26,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1860166364, now seen corresponding path program 107 times [2018-12-03 15:32:26,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:32:26,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:26,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:32:26,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:26,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:32:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 11790 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:32:31,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:31,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:32:31,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:32:31,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:32:31,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:31,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:32:31,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:32:31,340 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:32:31,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 109 check-sat command(s) [2018-12-03 15:32:31,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:32:31,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:32:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 11790 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:32:31,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:32:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11790 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:32:44,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:32:44,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 15:32:44,679 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:32:44,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 15:32:44,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 15:32:44,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 15:32:44,682 INFO L87 Difference]: Start difference. First operand 233 states and 235 transitions. Second operand 111 states. [2018-12-03 15:32:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:32:45,037 INFO L93 Difference]: Finished difference Result 249 states and 253 transitions. [2018-12-03 15:32:45,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 15:32:45,037 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 232 [2018-12-03 15:32:45,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:32:45,038 INFO L225 Difference]: With dead ends: 249 [2018-12-03 15:32:45,038 INFO L226 Difference]: Without dead ends: 235 [2018-12-03 15:32:45,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 15:32:45,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-12-03 15:32:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-12-03 15:32:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-12-03 15:32:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 237 transitions. [2018-12-03 15:32:45,048 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 237 transitions. Word has length 232 [2018-12-03 15:32:45,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:32:45,049 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 237 transitions. [2018-12-03 15:32:45,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 15:32:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 237 transitions. [2018-12-03 15:32:45,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-03 15:32:45,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:32:45,050 INFO L402 BasicCegarLoop]: trace histogram [110, 109, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:32:45,050 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:32:45,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:32:45,050 INFO L82 PathProgramCache]: Analyzing trace with hash 693353504, now seen corresponding path program 108 times [2018-12-03 15:32:45,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:32:45,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:45,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:32:45,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:45,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:32:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12008 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:32:49,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:49,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:32:49,501 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:32:49,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:32:49,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:49,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:32:49,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:32:49,509 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:32:49,659 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:32:49,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:32:49,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:32:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12008 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:32:49,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12008 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:33:03,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:03,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 15:33:03,143 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:03,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 15:33:03,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 15:33:03,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 15:33:03,145 INFO L87 Difference]: Start difference. First operand 235 states and 237 transitions. Second operand 112 states. [2018-12-03 15:33:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:03,540 INFO L93 Difference]: Finished difference Result 251 states and 255 transitions. [2018-12-03 15:33:03,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 15:33:03,541 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 234 [2018-12-03 15:33:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:03,542 INFO L225 Difference]: With dead ends: 251 [2018-12-03 15:33:03,542 INFO L226 Difference]: Without dead ends: 237 [2018-12-03 15:33:03,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 15:33:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-12-03 15:33:03,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-12-03 15:33:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-03 15:33:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 239 transitions. [2018-12-03 15:33:03,549 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 239 transitions. Word has length 234 [2018-12-03 15:33:03,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:03,550 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 239 transitions. [2018-12-03 15:33:03,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 15:33:03,550 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 239 transitions. [2018-12-03 15:33:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-12-03 15:33:03,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:03,550 INFO L402 BasicCegarLoop]: trace histogram [111, 110, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:33:03,551 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:03,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:03,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2095346660, now seen corresponding path program 109 times [2018-12-03 15:33:03,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:03,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:03,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:03,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:03,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:08,424 INFO L134 CoverageAnalysis]: Checked inductivity of 12228 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:33:08,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:08,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:08,425 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:08,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:08,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:08,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:33:08,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:08,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:08,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12228 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:33:08,636 INFO L316 TraceCheckSpWp]: Computing backward predicates...