java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 11:11:25,520 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 11:11:25,522 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 11:11:25,537 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 11:11:25,538 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 11:11:25,539 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 11:11:25,541 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 11:11:25,544 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 11:11:25,547 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 11:11:25,549 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 11:11:25,551 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 11:11:25,551 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 11:11:25,552 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 11:11:25,555 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 11:11:25,564 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 11:11:25,565 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 11:11:25,566 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 11:11:25,568 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 11:11:25,571 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 11:11:25,574 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 11:11:25,576 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 11:11:25,578 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 11:11:25,582 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 11:11:25,582 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 11:11:25,583 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 11:11:25,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 11:11:25,585 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 11:11:25,585 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 11:11:25,588 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 11:11:25,589 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 11:11:25,589 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 11:11:25,590 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 11:11:25,590 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 11:11:25,590 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 11:11:25,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 11:11:25,594 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 11:11:25,594 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-15 11:11:25,621 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 11:11:25,621 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 11:11:25,622 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 11:11:25,622 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 11:11:25,623 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 11:11:25,623 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 11:11:25,623 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 11:11:25,623 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 11:11:25,623 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 11:11:25,624 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-15 11:11:25,624 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-15 11:11:25,624 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 11:11:25,624 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 11:11:25,625 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 11:11:25,625 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 11:11:25,625 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 11:11:25,625 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 11:11:25,626 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 11:11:25,626 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 11:11:25,626 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 11:11:25,626 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 11:11:25,626 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 11:11:25,627 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 11:11:25,630 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 11:11:25,630 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 11:11:25,630 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 11:11:25,630 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 11:11:25,630 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 11:11:25,631 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 11:11:25,631 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 11:11:25,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:11:25,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 11:11:25,631 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 11:11:25,631 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 11:11:25,632 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 11:11:25,632 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 11:11:25,632 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 11:11:25,632 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 11:11:25,632 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 11:11:25,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 11:11:25,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 11:11:25,700 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 11:11:25,702 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 11:11:25,703 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 11:11:25,703 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2019-02-15 11:11:25,704 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2019-02-15 11:11:25,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 11:11:25,754 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 11:11:25,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 11:11:25,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 11:11:25,755 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 11:11:25,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 11:11:25,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 11:11:25,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 11:11:25,793 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 11:11:25,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 11:11:25,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 11:11:25,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 11:11:25,815 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 11:11:25,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (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 [2019-02-15 11:11:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 11:11:25,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 11:11:26,157 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 11:11:26,158 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-02-15 11:11:26,159 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:11:26 BoogieIcfgContainer [2019-02-15 11:11:26,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 11:11:26,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 11:11:26,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 11:11:26,163 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 11:11:26,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/2) ... [2019-02-15 11:11:26,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b21a532 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:11:26, skipping insertion in model container [2019-02-15 11:11:26,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:11:26" (2/2) ... [2019-02-15 11:11:26,170 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2019-02-15 11:11:26,181 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 11:11:26,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-15 11:11:26,206 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-15 11:11:26,244 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 11:11:26,244 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 11:11:26,245 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 11:11:26,245 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 11:11:26,245 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 11:11:26,245 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 11:11:26,245 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 11:11:26,246 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 11:11:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-15 11:11:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:11:26,270 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:26,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:11:26,274 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:26,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:26,282 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-15 11:11:26,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:26,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:26,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:26,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:11:26,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 11:11:26,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:11:26,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:11:26,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:11:26,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:11:26,519 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-15 11:11:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:26,660 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-02-15 11:11:26,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:11:26,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-15 11:11:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:26,674 INFO L225 Difference]: With dead ends: 10 [2019-02-15 11:11:26,674 INFO L226 Difference]: Without dead ends: 6 [2019-02-15 11:11:26,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:11:26,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-15 11:11:26,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-15 11:11:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-15 11:11:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-02-15 11:11:26,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-02-15 11:11:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:26,715 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-02-15 11:11:26,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:11:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-02-15 11:11:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:11:26,715 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:26,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:11:26,717 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:26,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:26,718 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2019-02-15 11:11:26,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:26,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:26,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:26,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:11:26,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 11:11:26,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:11:26,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:11:26,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:11:26,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:11:26,897 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-02-15 11:11:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:26,946 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-02-15 11:11:26,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:11:26,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 11:11:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:26,953 INFO L225 Difference]: With dead ends: 11 [2019-02-15 11:11:26,953 INFO L226 Difference]: Without dead ends: 7 [2019-02-15 11:11:26,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:11:26,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-15 11:11:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-15 11:11:26,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-15 11:11:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-15 11:11:26,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-02-15 11:11:26,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:26,958 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-15 11:11:26,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:11:26,958 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-15 11:11:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:11:26,959 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:26,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:11:26,959 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:26,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:26,960 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-15 11:11:26,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:26,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:26,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:27,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:27,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:27,206 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:11:27,209 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-15 11:11:27,260 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:11:27,260 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:11:27,320 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-02-15 11:11:46,853 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:11:46,854 INFO L272 AbstractInterpreter]: Visited 6 different actions 119 times. Merged at 5 different actions 79 times. Widened at 4 different actions 53 times. Found 33 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:11:46,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:46,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:11:46,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:46,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:46,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:46,872 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:46,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:47,318 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-02-15 11:11:47,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:11:47,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:47,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:47,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:11:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:47,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:47,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:11:47,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:47,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:47,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:11:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:47,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:47,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-15 11:11:47,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:47,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:11:47,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:11:47,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:11:47,890 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 10 states. [2019-02-15 11:11:48,052 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-02-15 11:11:48,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:48,210 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-02-15 11:11:48,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:11:48,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:11:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:48,212 INFO L225 Difference]: With dead ends: 12 [2019-02-15 11:11:48,212 INFO L226 Difference]: Without dead ends: 8 [2019-02-15 11:11:48,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:11:48,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-15 11:11:48,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-15 11:11:48,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-15 11:11:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-02-15 11:11:48,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-02-15 11:11:48,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:48,217 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-02-15 11:11:48,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:11:48,217 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-02-15 11:11:48,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:11:48,218 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:48,218 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-15 11:11:48,218 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:48,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:48,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1949841836, now seen corresponding path program 2 times [2019-02-15 11:11:48,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:48,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:48,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:48,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:48,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:48,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:48,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:48,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:48,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:48,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:48,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:48,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:48,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:48,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 11:11:48,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:48,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:48,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:48,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:48,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-02-15 11:11:48,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:48,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:11:48,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:11:48,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:11:48,665 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-02-15 11:11:49,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:49,007 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-02-15 11:11:49,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:11:49,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-15 11:11:49,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:49,008 INFO L225 Difference]: With dead ends: 11 [2019-02-15 11:11:49,008 INFO L226 Difference]: Without dead ends: 9 [2019-02-15 11:11:49,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:11:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-15 11:11:49,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-15 11:11:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-15 11:11:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-15 11:11:49,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-02-15 11:11:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:49,012 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-02-15 11:11:49,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 11:11:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-02-15 11:11:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:11:49,013 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:49,013 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-15 11:11:49,013 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:49,014 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 3 times [2019-02-15 11:11:49,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:49,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:49,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:49,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:49,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:49,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:49,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:49,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:49,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:49,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:49,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:49,148 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:49,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:49,162 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:49,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:49,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:49,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:11:49,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:49,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:49,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:11:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:11:49,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:49,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:11:49,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:49,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:49,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:11:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:11:49,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:49,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2019-02-15 11:11:49,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:49,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:11:49,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:11:49,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:11:49,589 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 11 states. [2019-02-15 11:11:49,871 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-02-15 11:11:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:50,077 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-02-15 11:11:50,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-15 11:11:50,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-15 11:11:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:50,078 INFO L225 Difference]: With dead ends: 17 [2019-02-15 11:11:50,078 INFO L226 Difference]: Without dead ends: 11 [2019-02-15 11:11:50,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:11:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-15 11:11:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-15 11:11:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-15 11:11:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-02-15 11:11:50,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-02-15 11:11:50,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:50,084 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-02-15 11:11:50,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:11:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-02-15 11:11:50,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 11:11:50,084 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:50,085 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-02-15 11:11:50,085 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:50,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:50,085 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 4 times [2019-02-15 11:11:50,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:50,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:50,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:50,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:50,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:50,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:50,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:50,249 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:50,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:50,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:50,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:50,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:50,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:50,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:50,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:11:50,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:50,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:50,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:11:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:50,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:50,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:11:50,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:50,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:50,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:11:50,550 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:50,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:50,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2019-02-15 11:11:50,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:50,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-15 11:11:50,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-15 11:11:50,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:11:50,570 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 16 states. [2019-02-15 11:11:50,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:50,862 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-02-15 11:11:50,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-15 11:11:50,863 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2019-02-15 11:11:50,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:50,864 INFO L225 Difference]: With dead ends: 18 [2019-02-15 11:11:50,864 INFO L226 Difference]: Without dead ends: 12 [2019-02-15 11:11:50,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:11:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-15 11:11:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-15 11:11:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-15 11:11:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-02-15 11:11:50,868 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-02-15 11:11:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:50,868 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-02-15 11:11:50,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-15 11:11:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-02-15 11:11:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-15 11:11:50,869 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:50,869 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2019-02-15 11:11:50,869 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:50,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:50,869 INFO L82 PathProgramCache]: Analyzing trace with hash 375043724, now seen corresponding path program 5 times [2019-02-15 11:11:50,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:50,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:50,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:50,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:50,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:50,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:50,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:50,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:50,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:50,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:50,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:50,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:50,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:50,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:11:50,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:50,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:50,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:51,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:51,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-02-15 11:11:51,279 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:51,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 11:11:51,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 11:11:51,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:11:51,280 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2019-02-15 11:11:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:51,340 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-02-15 11:11:51,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:11:51,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-02-15 11:11:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:51,341 INFO L225 Difference]: With dead ends: 15 [2019-02-15 11:11:51,341 INFO L226 Difference]: Without dead ends: 13 [2019-02-15 11:11:51,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:11:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-15 11:11:51,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-15 11:11:51,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 11:11:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-02-15 11:11:51,347 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-02-15 11:11:51,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:51,347 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-02-15 11:11:51,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 11:11:51,347 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-02-15 11:11:51,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-15 11:11:51,348 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:51,348 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-02-15 11:11:51,348 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:51,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:51,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 6 times [2019-02-15 11:11:51,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:51,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:51,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:51,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:51,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:51,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:51,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:51,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:51,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:51,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:51,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:51,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:51,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:51,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:51,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:51,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:51,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:11:51,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:51,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:51,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:11:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-15 11:11:51,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:51,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:11:51,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:51,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:51,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:11:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-15 11:11:51,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:51,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2019-02-15 11:11:51,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:51,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-15 11:11:51,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-15 11:11:51,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:11:51,872 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 17 states. [2019-02-15 11:11:52,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:52,395 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-02-15 11:11:52,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-15 11:11:52,396 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2019-02-15 11:11:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:52,397 INFO L225 Difference]: With dead ends: 23 [2019-02-15 11:11:52,397 INFO L226 Difference]: Without dead ends: 15 [2019-02-15 11:11:52,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2019-02-15 11:11:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-15 11:11:52,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-15 11:11:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-15 11:11:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-02-15 11:11:52,403 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-02-15 11:11:52,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:52,403 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-02-15 11:11:52,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-15 11:11:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-02-15 11:11:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-15 11:11:52,404 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:52,404 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-02-15 11:11:52,404 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:52,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:52,405 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 7 times [2019-02-15 11:11:52,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:52,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:52,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:52,695 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:52,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:52,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:52,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:52,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:52,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:52,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:52,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:52,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:52,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:52,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:11:52,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:53,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:53,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:11:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:53,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:53,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:11:53,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:53,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:53,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:11:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:53,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:53,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2019-02-15 11:11:53,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:53,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-15 11:11:53,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-15 11:11:53,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:11:53,292 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 22 states. [2019-02-15 11:11:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:53,858 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-02-15 11:11:53,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-15 11:11:53,859 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2019-02-15 11:11:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:53,860 INFO L225 Difference]: With dead ends: 24 [2019-02-15 11:11:53,860 INFO L226 Difference]: Without dead ends: 16 [2019-02-15 11:11:53,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-02-15 11:11:53,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-15 11:11:53,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-02-15 11:11:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 11:11:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-02-15 11:11:53,865 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-02-15 11:11:53,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:53,865 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-02-15 11:11:53,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-15 11:11:53,865 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-02-15 11:11:53,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-15 11:11:53,866 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:53,866 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2019-02-15 11:11:53,866 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:53,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1662915732, now seen corresponding path program 8 times [2019-02-15 11:11:53,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:53,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:53,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:53,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:53,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:53,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:53,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:53,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:53,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:53,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:53,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:53,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:53,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:54,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 11:11:54,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:54,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:54,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:54,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:54,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2019-02-15 11:11:54,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:54,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:11:54,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:11:54,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:11:54,204 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2019-02-15 11:11:54,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:54,336 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-02-15 11:11:54,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-15 11:11:54,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-02-15 11:11:54,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:54,339 INFO L225 Difference]: With dead ends: 19 [2019-02-15 11:11:54,339 INFO L226 Difference]: Without dead ends: 17 [2019-02-15 11:11:54,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:11:54,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-15 11:11:54,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-15 11:11:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 11:11:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-02-15 11:11:54,344 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-02-15 11:11:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:54,345 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-02-15 11:11:54,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:11:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-02-15 11:11:54,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-15 11:11:54,346 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:54,346 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-02-15 11:11:54,346 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:54,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:54,346 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 9 times [2019-02-15 11:11:54,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:54,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:54,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:54,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:54,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:54,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:54,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:54,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:54,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:54,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:54,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:54,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:54,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:54,794 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:54,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:54,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:54,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:11:54,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:54,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:54,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:11:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-15 11:11:54,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:55,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:11:55,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:55,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:55,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:11:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-15 11:11:55,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:55,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2019-02-15 11:11:55,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:55,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-15 11:11:55,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-15 11:11:55,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-02-15 11:11:55,203 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 23 states. [2019-02-15 11:11:55,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:55,948 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-02-15 11:11:55,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-15 11:11:55,949 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2019-02-15 11:11:55,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:55,949 INFO L225 Difference]: With dead ends: 29 [2019-02-15 11:11:55,949 INFO L226 Difference]: Without dead ends: 19 [2019-02-15 11:11:55,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2019-02-15 11:11:55,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-15 11:11:55,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-15 11:11:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-15 11:11:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-02-15 11:11:55,957 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-02-15 11:11:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:55,957 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-02-15 11:11:55,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-15 11:11:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-02-15 11:11:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-15 11:11:55,958 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:55,958 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-02-15 11:11:55,958 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:55,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:55,958 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 10 times [2019-02-15 11:11:55,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:55,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:55,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:55,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:55,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:56,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:56,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:56,220 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:56,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:56,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:56,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:56,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:56,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:56,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:56,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:11:56,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:56,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:56,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:11:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:56,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:56,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:11:56,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:56,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:56,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:11:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:56,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:56,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2019-02-15 11:11:56,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:56,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-15 11:11:56,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-15 11:11:56,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-02-15 11:11:56,693 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 28 states. [2019-02-15 11:11:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:57,422 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-02-15 11:11:57,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-15 11:11:57,423 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 18 [2019-02-15 11:11:57,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:57,423 INFO L225 Difference]: With dead ends: 30 [2019-02-15 11:11:57,423 INFO L226 Difference]: Without dead ends: 20 [2019-02-15 11:11:57,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 11:11:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-15 11:11:57,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-02-15 11:11:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-15 11:11:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-02-15 11:11:57,435 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2019-02-15 11:11:57,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:57,435 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-02-15 11:11:57,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-15 11:11:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-02-15 11:11:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-15 11:11:57,436 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:57,436 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2019-02-15 11:11:57,436 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:57,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:57,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1547184052, now seen corresponding path program 11 times [2019-02-15 11:11:57,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:57,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:57,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:57,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:57,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:58,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:58,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:58,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:58,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:58,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:58,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:58,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:58,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:58,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-15 11:11:58,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:58,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:58,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:58,272 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:58,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:58,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2019-02-15 11:11:58,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:58,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:11:58,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:11:58,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:11:58,292 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-02-15 11:11:58,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:58,475 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-02-15 11:11:58,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-15 11:11:58,477 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-02-15 11:11:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:58,478 INFO L225 Difference]: With dead ends: 23 [2019-02-15 11:11:58,478 INFO L226 Difference]: Without dead ends: 21 [2019-02-15 11:11:58,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:11:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-15 11:11:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-15 11:11:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-15 11:11:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-02-15 11:11:58,485 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-02-15 11:11:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:58,485 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-02-15 11:11:58,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:11:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-02-15 11:11:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-15 11:11:58,486 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:58,486 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-02-15 11:11:58,487 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:58,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:58,487 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 12 times [2019-02-15 11:11:58,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:58,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:58,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:58,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:58,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:58,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:58,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:58,821 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:58,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:58,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:58,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:58,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:58,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:58,844 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:58,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:58,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:59,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:11:59,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:59,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:59,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:11:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-15 11:11:59,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:59,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:11:59,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:59,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:59,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:11:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-15 11:11:59,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:59,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 38 [2019-02-15 11:11:59,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:59,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-15 11:11:59,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-15 11:11:59,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 11:11:59,654 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 29 states. [2019-02-15 11:12:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:00,561 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-02-15 11:12:00,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-15 11:12:00,562 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-02-15 11:12:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:00,563 INFO L225 Difference]: With dead ends: 35 [2019-02-15 11:12:00,563 INFO L226 Difference]: Without dead ends: 23 [2019-02-15 11:12:00,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=403, Invalid=2147, Unknown=0, NotChecked=0, Total=2550 [2019-02-15 11:12:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-15 11:12:00,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-15 11:12:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-15 11:12:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-02-15 11:12:00,572 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-02-15 11:12:00,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:00,573 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-02-15 11:12:00,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-15 11:12:00,573 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-02-15 11:12:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-15 11:12:00,573 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:00,574 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-02-15 11:12:00,574 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:00,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:00,574 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 13 times [2019-02-15 11:12:00,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:00,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:00,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:00,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:00,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:01,179 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:01,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:01,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:01,179 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:01,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:01,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:01,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:01,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:01,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:01,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:01,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:12:01,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:01,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:01,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:12:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:01,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:01,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:12:01,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:01,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:01,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:12:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:01,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:01,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2019-02-15 11:12:01,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:01,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-15 11:12:01,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-15 11:12:01,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 11:12:01,808 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 34 states. [2019-02-15 11:12:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:02,619 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-02-15 11:12:02,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-15 11:12:02,620 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2019-02-15 11:12:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:02,621 INFO L225 Difference]: With dead ends: 36 [2019-02-15 11:12:02,621 INFO L226 Difference]: Without dead ends: 24 [2019-02-15 11:12:02,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2019-02-15 11:12:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-15 11:12:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-02-15 11:12:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-15 11:12:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-02-15 11:12:02,629 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-02-15 11:12:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:02,629 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-02-15 11:12:02,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-15 11:12:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-02-15 11:12:02,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-15 11:12:02,630 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:02,630 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2019-02-15 11:12:02,630 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:02,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:02,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1283882284, now seen corresponding path program 14 times [2019-02-15 11:12:02,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:02,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:02,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:02,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:02,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:03,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:03,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:03,318 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:03,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:03,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:03,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:03,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:03,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:03,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-15 11:12:03,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:03,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:03,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:03,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:03,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2019-02-15 11:12:03,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:03,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:12:03,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:12:03,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:12:03,513 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 13 states. [2019-02-15 11:12:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:03,666 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-02-15 11:12:03,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-15 11:12:03,666 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-02-15 11:12:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:03,667 INFO L225 Difference]: With dead ends: 27 [2019-02-15 11:12:03,667 INFO L226 Difference]: Without dead ends: 25 [2019-02-15 11:12:03,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 20 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-02-15 11:12:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-15 11:12:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-15 11:12:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-15 11:12:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-02-15 11:12:03,676 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2019-02-15 11:12:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:03,676 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-02-15 11:12:03,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:12:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-02-15 11:12:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-15 11:12:03,677 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:03,677 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-02-15 11:12:03,677 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:03,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:03,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 15 times [2019-02-15 11:12:03,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:03,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:03,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:03,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:03,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:04,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:04,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:04,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:04,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:04,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:04,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:04,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:04,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:04,413 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:04,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:04,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:05,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:12:05,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:05,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:05,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:12:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-15 11:12:05,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:05,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:12:05,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:05,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:05,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:12:05,562 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-15 11:12:05,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:05,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 46 [2019-02-15 11:12:05,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:05,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-15 11:12:05,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-15 11:12:05,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2019-02-15 11:12:05,583 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2019-02-15 11:12:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:07,216 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-02-15 11:12:07,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-15 11:12:07,218 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2019-02-15 11:12:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:07,218 INFO L225 Difference]: With dead ends: 41 [2019-02-15 11:12:07,218 INFO L226 Difference]: Without dead ends: 27 [2019-02-15 11:12:07,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=553, Invalid=3107, Unknown=0, NotChecked=0, Total=3660 [2019-02-15 11:12:07,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-15 11:12:07,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-15 11:12:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-15 11:12:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-02-15 11:12:07,230 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-02-15 11:12:07,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:07,230 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-02-15 11:12:07,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-15 11:12:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-02-15 11:12:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-15 11:12:07,231 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:07,231 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-02-15 11:12:07,231 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:07,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:07,232 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 16 times [2019-02-15 11:12:07,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:07,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:07,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:07,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:07,711 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:07,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:07,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:07,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:07,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:07,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:07,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:07,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:07,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:07,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:08,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:12:08,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:08,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:08,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:12:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:08,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:08,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:12:08,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:08,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:08,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:12:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:08,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:08,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2019-02-15 11:12:08,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:08,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-15 11:12:08,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-15 11:12:08,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2019-02-15 11:12:08,374 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 40 states. [2019-02-15 11:12:09,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:09,539 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-02-15 11:12:09,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-15 11:12:09,539 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2019-02-15 11:12:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:09,540 INFO L225 Difference]: With dead ends: 42 [2019-02-15 11:12:09,540 INFO L226 Difference]: Without dead ends: 28 [2019-02-15 11:12:09,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=244, Invalid=2618, Unknown=0, NotChecked=0, Total=2862 [2019-02-15 11:12:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-15 11:12:09,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-02-15 11:12:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-15 11:12:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-02-15 11:12:09,553 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-02-15 11:12:09,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:09,553 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-02-15 11:12:09,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-15 11:12:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-02-15 11:12:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-15 11:12:09,562 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:09,562 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2019-02-15 11:12:09,563 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:09,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:09,563 INFO L82 PathProgramCache]: Analyzing trace with hash -568862196, now seen corresponding path program 17 times [2019-02-15 11:12:09,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:09,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:09,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:09,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:09,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:09,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:09,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:09,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:09,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:09,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:09,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:09,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:09,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:10,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-15 11:12:10,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:10,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:10,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:10,178 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:10,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:10,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2019-02-15 11:12:10,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:10,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-15 11:12:10,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-15 11:12:10,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:12:10,198 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 15 states. [2019-02-15 11:12:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:10,411 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-02-15 11:12:10,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-15 11:12:10,412 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-02-15 11:12:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:10,412 INFO L225 Difference]: With dead ends: 31 [2019-02-15 11:12:10,412 INFO L226 Difference]: Without dead ends: 29 [2019-02-15 11:12:10,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 24 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-02-15 11:12:10,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-15 11:12:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-15 11:12:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 11:12:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-02-15 11:12:10,422 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2019-02-15 11:12:10,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:10,422 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-02-15 11:12:10,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-15 11:12:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-02-15 11:12:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-15 11:12:10,423 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:10,423 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-02-15 11:12:10,423 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:10,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:10,423 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 18 times [2019-02-15 11:12:10,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:10,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:10,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:10,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:10,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:10,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:10,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:10,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:10,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:10,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:10,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:10,921 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:10,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:10,937 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:10,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:10,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:11,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:12:11,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:11,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:11,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:12:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-15 11:12:11,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:12,767 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-02-15 11:12:12,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:12:12,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:12,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:12,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:12:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-15 11:12:13,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:13,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 15] total 54 [2019-02-15 11:12:13,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:13,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-15 11:12:13,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-15 11:12:13,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2444, Unknown=0, NotChecked=0, Total=2862 [2019-02-15 11:12:13,473 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2019-02-15 11:12:14,543 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-02-15 11:12:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:15,892 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-02-15 11:12:15,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-15 11:12:15,893 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 28 [2019-02-15 11:12:15,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:15,893 INFO L225 Difference]: With dead ends: 47 [2019-02-15 11:12:15,893 INFO L226 Difference]: Without dead ends: 31 [2019-02-15 11:12:15,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=727, Invalid=4243, Unknown=0, NotChecked=0, Total=4970 [2019-02-15 11:12:15,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-15 11:12:15,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-15 11:12:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 11:12:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-02-15 11:12:15,906 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-02-15 11:12:15,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:15,907 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-02-15 11:12:15,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-15 11:12:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-02-15 11:12:15,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-15 11:12:15,908 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:15,908 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-02-15 11:12:15,908 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:15,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:15,908 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 19 times [2019-02-15 11:12:15,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:15,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:15,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:15,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:15,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:16,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:16,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:16,583 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:16,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:16,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:16,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:16,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:16,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:16,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:17,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:12:17,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:17,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:17,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:12:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:17,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:17,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:12:17,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:17,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:17,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:12:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:17,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:17,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2019-02-15 11:12:17,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:17,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-15 11:12:17,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-15 11:12:17,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2019-02-15 11:12:17,444 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 46 states. [2019-02-15 11:12:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:18,772 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-02-15 11:12:18,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-15 11:12:18,772 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2019-02-15 11:12:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:18,773 INFO L225 Difference]: With dead ends: 48 [2019-02-15 11:12:18,773 INFO L226 Difference]: Without dead ends: 32 [2019-02-15 11:12:18,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 11:12:18,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-15 11:12:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-02-15 11:12:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 11:12:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-02-15 11:12:18,787 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2019-02-15 11:12:18,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:18,788 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-02-15 11:12:18,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-15 11:12:18,788 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-02-15 11:12:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-15 11:12:18,789 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:18,789 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1] [2019-02-15 11:12:18,789 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:18,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:18,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1693839084, now seen corresponding path program 20 times [2019-02-15 11:12:18,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:18,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:18,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:18,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:18,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:19,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:19,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:19,268 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:19,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:19,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:19,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:19,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:19,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:19,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-15 11:12:19,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:19,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:19,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:19,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:19,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2019-02-15 11:12:19,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:19,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-15 11:12:19,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-15 11:12:19,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:12:19,549 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2019-02-15 11:12:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:19,767 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-02-15 11:12:19,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-15 11:12:19,768 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-02-15 11:12:19,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:19,769 INFO L225 Difference]: With dead ends: 35 [2019-02-15 11:12:19,769 INFO L226 Difference]: Without dead ends: 33 [2019-02-15 11:12:19,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-02-15 11:12:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-15 11:12:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-15 11:12:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-15 11:12:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-02-15 11:12:19,784 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2019-02-15 11:12:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:19,785 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-02-15 11:12:19,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-15 11:12:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-02-15 11:12:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-15 11:12:19,786 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:19,786 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-02-15 11:12:19,786 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:19,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 21 times [2019-02-15 11:12:19,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:19,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:19,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:19,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:19,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:20,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:20,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:20,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:20,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:20,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:20,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:20,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:20,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:20,668 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:20,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:20,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:21,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:12:21,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:21,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:21,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:12:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-15 11:12:21,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:21,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:12:21,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:21,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:21,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:12:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-15 11:12:21,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:21,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17, 17] total 62 [2019-02-15 11:12:21,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:21,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-15 11:12:21,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-15 11:12:21,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=3240, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 11:12:21,968 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 47 states. [2019-02-15 11:12:23,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:23,784 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-02-15 11:12:23,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-15 11:12:23,786 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 32 [2019-02-15 11:12:23,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:23,786 INFO L225 Difference]: With dead ends: 53 [2019-02-15 11:12:23,786 INFO L226 Difference]: Without dead ends: 35 [2019-02-15 11:12:23,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=925, Invalid=5555, Unknown=0, NotChecked=0, Total=6480 [2019-02-15 11:12:23,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-15 11:12:23,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-15 11:12:23,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-15 11:12:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-02-15 11:12:23,799 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-02-15 11:12:23,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:23,799 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-02-15 11:12:23,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-15 11:12:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-02-15 11:12:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-15 11:12:23,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:23,800 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-02-15 11:12:23,800 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:23,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:23,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 22 times [2019-02-15 11:12:23,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:23,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:23,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:23,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:23,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:24,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:24,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:24,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:24,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:24,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:24,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:24,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:24,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:24,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:25,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:12:25,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:25,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:25,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:12:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:25,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:25,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:12:25,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:25,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:25,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:12:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:25,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:25,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2019-02-15 11:12:25,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:25,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-15 11:12:25,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-15 11:12:25,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2501, Unknown=0, NotChecked=0, Total=2652 [2019-02-15 11:12:25,910 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 52 states. [2019-02-15 11:12:27,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:27,695 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-02-15 11:12:27,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-15 11:12:27,696 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 34 [2019-02-15 11:12:27,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:27,696 INFO L225 Difference]: With dead ends: 54 [2019-02-15 11:12:27,696 INFO L226 Difference]: Without dead ends: 36 [2019-02-15 11:12:27,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=320, Invalid=4510, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 11:12:27,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-15 11:12:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-02-15 11:12:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-15 11:12:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-02-15 11:12:27,711 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2019-02-15 11:12:27,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:27,711 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-02-15 11:12:27,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-15 11:12:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-02-15 11:12:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-15 11:12:27,712 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:27,712 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1] [2019-02-15 11:12:27,712 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:27,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:27,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1394260940, now seen corresponding path program 23 times [2019-02-15 11:12:27,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:27,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:27,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:27,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:27,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:27,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:27,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:27,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:27,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:27,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:27,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:27,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:27,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:27,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-15 11:12:27,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:27,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:27,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:28,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:28,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2019-02-15 11:12:28,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:28,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-15 11:12:28,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-15 11:12:28,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:12:28,219 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2019-02-15 11:12:28,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:28,453 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-02-15 11:12:28,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-15 11:12:28,453 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-02-15 11:12:28,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:28,454 INFO L225 Difference]: With dead ends: 39 [2019-02-15 11:12:28,454 INFO L226 Difference]: Without dead ends: 37 [2019-02-15 11:12:28,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 32 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-02-15 11:12:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-15 11:12:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-15 11:12:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-15 11:12:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-02-15 11:12:28,472 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-02-15 11:12:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:28,472 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-02-15 11:12:28,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-15 11:12:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-02-15 11:12:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-15 11:12:28,473 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:28,473 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-02-15 11:12:28,473 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:28,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:28,474 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 24 times [2019-02-15 11:12:28,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:28,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:28,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:28,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:28,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:29,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:29,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:29,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:29,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:29,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:29,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:29,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:29,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:29,443 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:29,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:29,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:30,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:12:30,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:30,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:30,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:12:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-15 11:12:30,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:30,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:12:30,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:30,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:30,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:12:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-15 11:12:31,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:31,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19, 19] total 70 [2019-02-15 11:12:31,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:31,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-15 11:12:31,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-15 11:12:31,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=4148, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 11:12:31,254 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 53 states. [2019-02-15 11:12:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:33,590 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-02-15 11:12:33,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-15 11:12:33,590 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 36 [2019-02-15 11:12:33,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:33,590 INFO L225 Difference]: With dead ends: 59 [2019-02-15 11:12:33,590 INFO L226 Difference]: Without dead ends: 39 [2019-02-15 11:12:33,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1147, Invalid=7043, Unknown=0, NotChecked=0, Total=8190 [2019-02-15 11:12:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-15 11:12:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-15 11:12:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-15 11:12:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-02-15 11:12:33,607 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-02-15 11:12:33,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:33,607 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-02-15 11:12:33,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-15 11:12:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-02-15 11:12:33,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-15 11:12:33,608 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:33,608 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-02-15 11:12:33,608 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:33,609 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 25 times [2019-02-15 11:12:33,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:33,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:33,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:33,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:33,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:34,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:34,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:34,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:34,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:34,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:34,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:34,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:34,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:34,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:35,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:12:35,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:35,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:35,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:12:35,707 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:35,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:35,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:12:35,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:35,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:35,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:12:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:35,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:35,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2019-02-15 11:12:35,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:35,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-15 11:12:35,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-15 11:12:35,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2019-02-15 11:12:35,980 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 58 states. [2019-02-15 11:12:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:38,075 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-02-15 11:12:38,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-15 11:12:38,075 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 38 [2019-02-15 11:12:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:38,076 INFO L225 Difference]: With dead ends: 60 [2019-02-15 11:12:38,076 INFO L226 Difference]: Without dead ends: 40 [2019-02-15 11:12:38,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2019-02-15 11:12:38,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-15 11:12:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-02-15 11:12:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-15 11:12:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-02-15 11:12:38,092 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-02-15 11:12:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:38,092 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-02-15 11:12:38,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-15 11:12:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-02-15 11:12:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-15 11:12:38,093 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:38,093 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1] [2019-02-15 11:12:38,094 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:38,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:38,094 INFO L82 PathProgramCache]: Analyzing trace with hash 536887468, now seen corresponding path program 26 times [2019-02-15 11:12:38,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:38,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:38,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:38,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:38,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:38,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:38,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:38,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:38,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:38,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:38,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:38,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:38,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:38,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-15 11:12:38,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:38,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:38,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:39,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:39,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2019-02-15 11:12:39,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:39,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-15 11:12:39,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-15 11:12:39,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:12:39,449 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 21 states. [2019-02-15 11:12:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:39,719 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-02-15 11:12:39,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-15 11:12:39,719 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-02-15 11:12:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:39,720 INFO L225 Difference]: With dead ends: 43 [2019-02-15 11:12:39,720 INFO L226 Difference]: Without dead ends: 41 [2019-02-15 11:12:39,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 36 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-02-15 11:12:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-15 11:12:39,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-15 11:12:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 11:12:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-02-15 11:12:39,740 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2019-02-15 11:12:39,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:39,740 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-02-15 11:12:39,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-15 11:12:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-02-15 11:12:39,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-15 11:12:39,741 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:39,741 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-02-15 11:12:39,741 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:39,741 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 27 times [2019-02-15 11:12:39,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:39,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:39,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:39,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:39,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:41,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:41,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:41,314 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:41,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:41,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:41,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:41,323 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:41,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:41,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:41,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:41,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:42,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:12:42,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:42,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:42,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:12:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-15 11:12:42,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:42,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:12:42,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:42,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:42,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:12:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-15 11:12:43,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:43,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 21, 21] total 78 [2019-02-15 11:12:43,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:43,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-15 11:12:43,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-15 11:12:43,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=5168, Unknown=0, NotChecked=0, Total=6006 [2019-02-15 11:12:43,326 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 59 states. [2019-02-15 11:12:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:46,244 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-02-15 11:12:46,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-15 11:12:46,245 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 40 [2019-02-15 11:12:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:46,245 INFO L225 Difference]: With dead ends: 65 [2019-02-15 11:12:46,245 INFO L226 Difference]: Without dead ends: 43 [2019-02-15 11:12:46,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1393, Invalid=8707, Unknown=0, NotChecked=0, Total=10100 [2019-02-15 11:12:46,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-15 11:12:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-15 11:12:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-15 11:12:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-02-15 11:12:46,269 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-02-15 11:12:46,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:46,269 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-02-15 11:12:46,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-15 11:12:46,270 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-02-15 11:12:46,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-15 11:12:46,270 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:46,270 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-02-15 11:12:46,270 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:46,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:46,271 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 28 times [2019-02-15 11:12:46,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:46,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:46,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:46,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:46,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:47,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:47,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:47,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:47,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:47,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:47,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:47,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:47,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:47,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:48,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:12:48,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:48,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:48,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:12:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:48,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:48,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:12:48,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:48,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:48,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:12:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:48,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:48,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2019-02-15 11:12:48,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:48,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-15 11:12:48,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-15 11:12:48,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3845, Unknown=0, NotChecked=0, Total=4032 [2019-02-15 11:12:48,660 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 64 states. [2019-02-15 11:12:51,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:51,311 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-02-15 11:12:51,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-15 11:12:51,311 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 42 [2019-02-15 11:12:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:51,312 INFO L225 Difference]: With dead ends: 66 [2019-02-15 11:12:51,312 INFO L226 Difference]: Without dead ends: 44 [2019-02-15 11:12:51,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 47 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=396, Invalid=6914, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 11:12:51,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-15 11:12:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-02-15 11:12:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-15 11:12:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-02-15 11:12:51,335 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2019-02-15 11:12:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:51,336 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-02-15 11:12:51,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-15 11:12:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-02-15 11:12:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-15 11:12:51,336 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:51,337 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1] [2019-02-15 11:12:51,337 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:51,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash -392135284, now seen corresponding path program 29 times [2019-02-15 11:12:51,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:51,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:51,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:51,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:51,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:51,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:51,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:51,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:51,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:51,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:51,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:51,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-15 11:12:51,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:51,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:51,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:52,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:52,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2019-02-15 11:12:52,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:52,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-15 11:12:52,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-15 11:12:52,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-02-15 11:12:52,093 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 23 states. [2019-02-15 11:12:52,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:52,394 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-02-15 11:12:52,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-15 11:12:52,394 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-02-15 11:12:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:52,395 INFO L225 Difference]: With dead ends: 47 [2019-02-15 11:12:52,395 INFO L226 Difference]: Without dead ends: 45 [2019-02-15 11:12:52,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 40 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-02-15 11:12:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-15 11:12:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-15 11:12:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-15 11:12:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-02-15 11:12:52,411 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2019-02-15 11:12:52,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:52,412 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-02-15 11:12:52,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-15 11:12:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-02-15 11:12:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-15 11:12:52,412 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:52,412 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-02-15 11:12:52,412 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:52,413 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 30 times [2019-02-15 11:12:52,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:52,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:52,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:52,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:52,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:53,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:53,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:53,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:53,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:53,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:53,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:53,442 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:53,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:53,467 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:53,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:53,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:54,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:12:54,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:54,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:54,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:12:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-15 11:12:54,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:54,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:12:54,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:54,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:54,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:12:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-15 11:12:56,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:56,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23, 23] total 86 [2019-02-15 11:12:56,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:56,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-15 11:12:56,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-15 11:12:56,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1010, Invalid=6300, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 11:12:56,057 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 65 states. [2019-02-15 11:12:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:59,441 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-02-15 11:12:59,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-15 11:12:59,442 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 44 [2019-02-15 11:12:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:59,443 INFO L225 Difference]: With dead ends: 71 [2019-02-15 11:12:59,443 INFO L226 Difference]: Without dead ends: 47 [2019-02-15 11:12:59,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1663, Invalid=10547, Unknown=0, NotChecked=0, Total=12210 [2019-02-15 11:12:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-15 11:12:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-15 11:12:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 11:12:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-02-15 11:12:59,461 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-02-15 11:12:59,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:59,462 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-02-15 11:12:59,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-15 11:12:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-02-15 11:12:59,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-15 11:12:59,463 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:59,463 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-02-15 11:12:59,463 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:59,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:59,463 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 31 times [2019-02-15 11:12:59,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:59,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:59,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:59,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:59,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:01,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:01,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:01,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:01,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:01,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:01,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:01,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:01,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:01,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:02,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:13:02,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:02,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:02,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:13:02,598 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:02,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:02,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:13:02,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:02,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:02,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:13:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:03,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:03,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2019-02-15 11:13:03,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:03,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-15 11:13:03,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-15 11:13:03,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 11:13:03,094 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 70 states. [2019-02-15 11:13:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:06,197 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-02-15 11:13:06,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-15 11:13:06,197 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 46 [2019-02-15 11:13:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:06,198 INFO L225 Difference]: With dead ends: 72 [2019-02-15 11:13:06,198 INFO L226 Difference]: Without dead ends: 48 [2019-02-15 11:13:06,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 51 SyntacticMatches, 16 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 11:13:06,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-15 11:13:06,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-02-15 11:13:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-15 11:13:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-02-15 11:13:06,217 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2019-02-15 11:13:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:06,217 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-02-15 11:13:06,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-15 11:13:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-02-15 11:13:06,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-15 11:13:06,217 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:06,217 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1] [2019-02-15 11:13:06,218 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:06,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:06,218 INFO L82 PathProgramCache]: Analyzing trace with hash 259355244, now seen corresponding path program 32 times [2019-02-15 11:13:06,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:06,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:06,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:06,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:06,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:06,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:06,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:06,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:06,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:06,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:06,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:06,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:06,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:06,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-15 11:13:06,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:06,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:06,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:07,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:07,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2019-02-15 11:13:07,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:07,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-15 11:13:07,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-15 11:13:07,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-02-15 11:13:07,071 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 25 states. [2019-02-15 11:13:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:07,447 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-02-15 11:13:07,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-15 11:13:07,448 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-02-15 11:13:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:07,448 INFO L225 Difference]: With dead ends: 51 [2019-02-15 11:13:07,448 INFO L226 Difference]: Without dead ends: 49 [2019-02-15 11:13:07,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 71 SyntacticMatches, 44 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2019-02-15 11:13:07,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-15 11:13:07,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-15 11:13:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-15 11:13:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-02-15 11:13:07,468 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2019-02-15 11:13:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:07,469 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-02-15 11:13:07,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-15 11:13:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-02-15 11:13:07,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-15 11:13:07,469 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:07,470 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-02-15 11:13:07,470 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:07,470 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 33 times [2019-02-15 11:13:07,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:07,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:07,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:07,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:07,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:08,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:08,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:08,682 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:08,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:08,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:08,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:08,691 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:08,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:08,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:08,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:08,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:09,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:13:09,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:09,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:09,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:13:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-15 11:13:10,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:10,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:13:10,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:10,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:10,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:13:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-15 11:13:11,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:11,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 25, 25] total 94 [2019-02-15 11:13:11,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:11,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-15 11:13:11,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-15 11:13:11,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1198, Invalid=7544, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 11:13:11,943 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 71 states. [2019-02-15 11:13:15,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:15,810 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-02-15 11:13:15,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-15 11:13:15,810 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 48 [2019-02-15 11:13:15,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:15,811 INFO L225 Difference]: With dead ends: 77 [2019-02-15 11:13:15,811 INFO L226 Difference]: Without dead ends: 51 [2019-02-15 11:13:15,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1957, Invalid=12563, Unknown=0, NotChecked=0, Total=14520 [2019-02-15 11:13:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-15 11:13:15,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-15 11:13:15,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-15 11:13:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-02-15 11:13:15,834 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-02-15 11:13:15,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:15,834 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-02-15 11:13:15,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-15 11:13:15,834 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-02-15 11:13:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-15 11:13:15,834 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:15,834 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-02-15 11:13:15,835 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:15,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:15,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 34 times [2019-02-15 11:13:15,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:15,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:15,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:15,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:15,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:17,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:17,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:17,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:17,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:17,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:17,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:17,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:17,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:17,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:18,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:13:18,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:18,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:18,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:13:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:19,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:19,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:13:19,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:19,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:19,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:13:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:19,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:19,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 75 [2019-02-15 11:13:19,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:19,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-15 11:13:19,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-15 11:13:19,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5477, Unknown=0, NotChecked=0, Total=5700 [2019-02-15 11:13:19,579 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 76 states. [2019-02-15 11:13:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:22,790 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-02-15 11:13:22,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-15 11:13:22,791 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 50 [2019-02-15 11:13:22,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:22,791 INFO L225 Difference]: With dead ends: 78 [2019-02-15 11:13:22,792 INFO L226 Difference]: Without dead ends: 52 [2019-02-15 11:13:22,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 55 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=472, Invalid=9830, Unknown=0, NotChecked=0, Total=10302 [2019-02-15 11:13:22,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-15 11:13:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-02-15 11:13:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-15 11:13:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-02-15 11:13:22,813 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-02-15 11:13:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:22,813 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-02-15 11:13:22,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-15 11:13:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-02-15 11:13:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-15 11:13:22,814 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:22,814 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1] [2019-02-15 11:13:22,814 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash -596041908, now seen corresponding path program 35 times [2019-02-15 11:13:22,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:22,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:22,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:22,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:22,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:23,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:23,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:23,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:23,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:23,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:23,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:23,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:23,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:23,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-15 11:13:23,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:23,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:23,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:23,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:23,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2019-02-15 11:13:23,819 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:23,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-15 11:13:23,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-15 11:13:23,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-02-15 11:13:23,819 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 27 states. [2019-02-15 11:13:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:24,245 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-02-15 11:13:24,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-15 11:13:24,245 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-02-15 11:13:24,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:24,246 INFO L225 Difference]: With dead ends: 55 [2019-02-15 11:13:24,246 INFO L226 Difference]: Without dead ends: 53 [2019-02-15 11:13:24,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 48 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-02-15 11:13:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-15 11:13:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-15 11:13:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-15 11:13:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-02-15 11:13:24,270 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 51 [2019-02-15 11:13:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:24,271 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-02-15 11:13:24,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-15 11:13:24,271 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-02-15 11:13:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-15 11:13:24,271 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:24,272 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-02-15 11:13:24,272 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:24,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:24,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 36 times [2019-02-15 11:13:24,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:24,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:24,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:24,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:24,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:26,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:26,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:26,175 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:26,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:26,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:26,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:26,184 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:26,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:26,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:26,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:26,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:27,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:13:27,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:27,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:27,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:13:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-15 11:13:28,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:28,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:13:28,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:28,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:28,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:13:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-15 11:13:29,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:29,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 27, 27] total 102 [2019-02-15 11:13:29,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:29,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-15 11:13:29,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-15 11:13:29,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1402, Invalid=8900, Unknown=0, NotChecked=0, Total=10302 [2019-02-15 11:13:29,783 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 77 states. [2019-02-15 11:13:34,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:34,148 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-02-15 11:13:34,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-15 11:13:34,149 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 52 [2019-02-15 11:13:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:34,149 INFO L225 Difference]: With dead ends: 83 [2019-02-15 11:13:34,149 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 11:13:34,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2275, Invalid=14755, Unknown=0, NotChecked=0, Total=17030 [2019-02-15 11:13:34,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 11:13:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-15 11:13:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-15 11:13:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-02-15 11:13:34,179 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-02-15 11:13:34,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:34,179 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-02-15 11:13:34,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-15 11:13:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-02-15 11:13:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-15 11:13:34,180 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:34,180 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-02-15 11:13:34,180 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:34,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:34,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 37 times [2019-02-15 11:13:34,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:34,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:34,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:34,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:34,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:35,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:35,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:35,674 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:35,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:35,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:35,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:35,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:35,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:35,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:37,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:13:37,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:37,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:37,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:13:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:37,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:37,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:13:37,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:37,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:37,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:13:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:38,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:38,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 81 [2019-02-15 11:13:38,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:38,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-15 11:13:38,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-15 11:13:38,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2019-02-15 11:13:38,374 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 82 states. [2019-02-15 11:13:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:42,487 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-02-15 11:13:42,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-15 11:13:42,487 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 54 [2019-02-15 11:13:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:42,488 INFO L225 Difference]: With dead ends: 84 [2019-02-15 11:13:42,488 INFO L226 Difference]: Without dead ends: 56 [2019-02-15 11:13:42,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 59 SyntacticMatches, 20 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2019-02-15 11:13:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-15 11:13:42,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-02-15 11:13:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-15 11:13:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-02-15 11:13:42,513 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2019-02-15 11:13:42,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:42,513 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-02-15 11:13:42,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-15 11:13:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-02-15 11:13:42,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-15 11:13:42,513 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:42,513 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1] [2019-02-15 11:13:42,514 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:42,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:42,514 INFO L82 PathProgramCache]: Analyzing trace with hash 488997932, now seen corresponding path program 38 times [2019-02-15 11:13:42,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:42,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:42,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:42,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:42,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:43,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:43,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:43,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:43,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:43,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:43,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:43,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:43,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:43,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-15 11:13:43,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:43,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:43,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:43,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:43,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2019-02-15 11:13:43,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:43,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-15 11:13:43,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-15 11:13:43,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-02-15 11:13:43,762 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 29 states. [2019-02-15 11:13:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:44,243 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-02-15 11:13:44,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-15 11:13:44,243 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-02-15 11:13:44,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:44,243 INFO L225 Difference]: With dead ends: 59 [2019-02-15 11:13:44,243 INFO L226 Difference]: Without dead ends: 57 [2019-02-15 11:13:44,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 83 SyntacticMatches, 52 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2019-02-15 11:13:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-15 11:13:44,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-15 11:13:44,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-15 11:13:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-02-15 11:13:44,269 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 55 [2019-02-15 11:13:44,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:44,269 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-02-15 11:13:44,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-15 11:13:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-02-15 11:13:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-15 11:13:44,270 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:44,270 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-02-15 11:13:44,270 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:44,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:44,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 39 times [2019-02-15 11:13:44,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:44,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:44,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:44,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:44,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:46,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:46,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:46,260 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:46,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:46,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:46,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:46,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:46,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:46,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:46,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:46,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:48,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:13:48,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:48,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:48,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:13:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-15 11:13:48,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:48,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:13:48,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:48,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:48,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:13:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-15 11:13:50,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:50,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 29, 29] total 110 [2019-02-15 11:13:50,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:50,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-15 11:13:50,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-15 11:13:50,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=10368, Unknown=0, NotChecked=0, Total=11990 [2019-02-15 11:13:50,383 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 83 states. [2019-02-15 11:13:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:55,562 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-02-15 11:13:55,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-15 11:13:55,562 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 56 [2019-02-15 11:13:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:55,563 INFO L225 Difference]: With dead ends: 89 [2019-02-15 11:13:55,563 INFO L226 Difference]: Without dead ends: 59 [2019-02-15 11:13:55,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=2617, Invalid=17123, Unknown=0, NotChecked=0, Total=19740 [2019-02-15 11:13:55,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-15 11:13:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-15 11:13:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-15 11:13:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-02-15 11:13:55,592 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-02-15 11:13:55,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:55,592 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-02-15 11:13:55,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-15 11:13:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-02-15 11:13:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-15 11:13:55,592 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:55,592 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-02-15 11:13:55,592 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:55,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:55,593 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 40 times [2019-02-15 11:13:55,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:55,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:55,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:55,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:55,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:57,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:57,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:57,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:57,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:57,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:57,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:57,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:57,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:57,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:59,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:13:59,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:59,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:59,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:13:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:59,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:59,768 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-02-15 11:13:59,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:13:59,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:59,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:59,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:14:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:00,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:00,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 87 [2019-02-15 11:14:00,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:00,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-15 11:14:00,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-15 11:14:00,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=7397, Unknown=0, NotChecked=0, Total=7656 [2019-02-15 11:14:00,754 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 88 states. [2019-02-15 11:14:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:05,424 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-02-15 11:14:05,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-15 11:14:05,424 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 58 [2019-02-15 11:14:05,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:05,425 INFO L225 Difference]: With dead ends: 90 [2019-02-15 11:14:05,426 INFO L226 Difference]: Without dead ends: 60 [2019-02-15 11:14:05,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 63 SyntacticMatches, 22 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=548, Invalid=13258, Unknown=0, NotChecked=0, Total=13806 [2019-02-15 11:14:05,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-15 11:14:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-02-15 11:14:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-15 11:14:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-02-15 11:14:05,452 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2019-02-15 11:14:05,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:05,453 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-02-15 11:14:05,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-15 11:14:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-02-15 11:14:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-15 11:14:05,453 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:05,453 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1] [2019-02-15 11:14:05,454 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:05,454 INFO L82 PathProgramCache]: Analyzing trace with hash -998989556, now seen corresponding path program 41 times [2019-02-15 11:14:05,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:05,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:05,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:05,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:05,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:05,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:05,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:05,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:05,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:05,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:05,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:14:05,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:14:05,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:14:06,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-15 11:14:06,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:06,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:06,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:06,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:06,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2019-02-15 11:14:06,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:06,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-15 11:14:06,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-15 11:14:06,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-02-15 11:14:06,829 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 31 states. [2019-02-15 11:14:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:07,347 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-02-15 11:14:07,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-15 11:14:07,347 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-02-15 11:14:07,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:07,347 INFO L225 Difference]: With dead ends: 63 [2019-02-15 11:14:07,347 INFO L226 Difference]: Without dead ends: 61 [2019-02-15 11:14:07,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 89 SyntacticMatches, 56 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-02-15 11:14:07,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-15 11:14:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-15 11:14:07,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 11:14:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-02-15 11:14:07,378 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2019-02-15 11:14:07,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:07,378 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-02-15 11:14:07,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-15 11:14:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-02-15 11:14:07,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-15 11:14:07,379 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:07,379 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-02-15 11:14:07,379 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:07,379 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 42 times [2019-02-15 11:14:07,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:07,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:07,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:07,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:07,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:09,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:09,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:09,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:09,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:09,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:09,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:14:09,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:14:09,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:14:09,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:14:09,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:09,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:11,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:14:11,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:11,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:11,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:14:11,646 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-15 11:14:11,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:11,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:14:11,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:11,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:11,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:14:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-15 11:14:14,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:14,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 31, 31] total 118 [2019-02-15 11:14:14,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:14,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-15 11:14:14,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-15 11:14:14,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=11948, Unknown=0, NotChecked=0, Total=13806 [2019-02-15 11:14:14,295 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 89 states. [2019-02-15 11:14:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:19,883 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2019-02-15 11:14:19,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-15 11:14:19,884 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 60 [2019-02-15 11:14:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:19,885 INFO L225 Difference]: With dead ends: 95 [2019-02-15 11:14:19,885 INFO L226 Difference]: Without dead ends: 63 [2019-02-15 11:14:19,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2983, Invalid=19667, Unknown=0, NotChecked=0, Total=22650 [2019-02-15 11:14:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-15 11:14:19,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-15 11:14:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-15 11:14:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-02-15 11:14:19,915 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-02-15 11:14:19,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:19,916 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-02-15 11:14:19,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-15 11:14:19,916 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-02-15 11:14:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-15 11:14:19,916 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:19,917 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-02-15 11:14:19,917 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:19,917 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 43 times [2019-02-15 11:14:19,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:19,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:19,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:19,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:19,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:21,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:21,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:21,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:21,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:21,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:21,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:14:21,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:21,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:14:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:21,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:24,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:14:24,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:24,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:24,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:14:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:24,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:24,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:14:24,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:24,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:24,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:14:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:25,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:25,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 93 [2019-02-15 11:14:25,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:25,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-15 11:14:25,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-15 11:14:25,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=8465, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 11:14:25,256 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 94 states. [2019-02-15 11:14:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:30,528 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-02-15 11:14:30,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-15 11:14:30,528 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 62 [2019-02-15 11:14:30,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:30,529 INFO L225 Difference]: With dead ends: 96 [2019-02-15 11:14:30,529 INFO L226 Difference]: Without dead ends: 64 [2019-02-15 11:14:30,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 24 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=586, Invalid=15164, Unknown=0, NotChecked=0, Total=15750 [2019-02-15 11:14:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-15 11:14:30,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-02-15 11:14:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-15 11:14:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-02-15 11:14:30,559 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-02-15 11:14:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:30,559 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-02-15 11:14:30,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-15 11:14:30,559 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-02-15 11:14:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-15 11:14:30,559 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:30,559 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1] [2019-02-15 11:14:30,560 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:30,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:30,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1965001236, now seen corresponding path program 44 times [2019-02-15 11:14:30,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:30,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:30,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:30,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:30,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:31,601 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:31,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:31,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:31,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:31,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:31,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:31,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:14:31,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:14:31,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:14:31,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-15 11:14:31,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:31,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:31,782 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:31,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:32,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:32,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2019-02-15 11:14:32,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:32,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-15 11:14:32,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-15 11:14:32,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-02-15 11:14:32,888 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 33 states. [2019-02-15 11:14:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:33,719 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-02-15 11:14:33,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-15 11:14:33,719 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-02-15 11:14:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:33,720 INFO L225 Difference]: With dead ends: 67 [2019-02-15 11:14:33,720 INFO L226 Difference]: Without dead ends: 65 [2019-02-15 11:14:33,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 95 SyntacticMatches, 60 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-02-15 11:14:33,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-15 11:14:33,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-15 11:14:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-15 11:14:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-02-15 11:14:33,752 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 63 [2019-02-15 11:14:33,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:33,752 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-02-15 11:14:33,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-15 11:14:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-02-15 11:14:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-15 11:14:33,753 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:33,753 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-02-15 11:14:33,753 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:33,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:33,753 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 45 times [2019-02-15 11:14:33,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:33,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:33,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:33,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:33,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:36,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:36,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:36,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:36,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:36,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:36,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:14:36,111 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:14:36,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:14:36,153 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:14:36,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:36,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:39,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:14:39,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:39,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:39,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:14:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-15 11:14:39,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:39,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:14:39,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:39,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:39,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:14:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-15 11:14:41,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:41,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 33, 33] total 126 [2019-02-15 11:14:41,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:41,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-15 11:14:41,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-15 11:14:41,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2110, Invalid=13640, Unknown=0, NotChecked=0, Total=15750 [2019-02-15 11:14:41,926 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 95 states. [2019-02-15 11:14:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:48,305 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2019-02-15 11:14:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-15 11:14:48,306 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 64 [2019-02-15 11:14:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:48,307 INFO L225 Difference]: With dead ends: 101 [2019-02-15 11:14:48,307 INFO L226 Difference]: Without dead ends: 67 [2019-02-15 11:14:48,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=3373, Invalid=22387, Unknown=0, NotChecked=0, Total=25760 [2019-02-15 11:14:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-15 11:14:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-15 11:14:48,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-15 11:14:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-02-15 11:14:48,341 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-02-15 11:14:48,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:48,341 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-02-15 11:14:48,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-15 11:14:48,341 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-02-15 11:14:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-15 11:14:48,342 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:48,342 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-02-15 11:14:48,342 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:48,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:48,342 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 46 times [2019-02-15 11:14:48,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:48,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:48,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:48,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:48,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:51,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:51,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:51,498 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:51,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:51,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:51,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:14:51,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:51,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:14:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:51,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:54,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:14:54,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:54,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:54,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:14:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:54,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:54,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:14:54,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:54,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:54,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:14:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:55,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:55,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 99 [2019-02-15 11:14:55,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:55,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-15 11:14:55,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-15 11:14:55,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2019-02-15 11:14:55,404 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 100 states. [2019-02-15 11:15:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:00,394 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-02-15 11:15:00,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-15 11:15:00,394 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 66 [2019-02-15 11:15:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:00,395 INFO L225 Difference]: With dead ends: 102 [2019-02-15 11:15:00,395 INFO L226 Difference]: Without dead ends: 68 [2019-02-15 11:15:00,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 72 SyntacticMatches, 25 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2019-02-15 11:15:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-15 11:15:00,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-02-15 11:15:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-15 11:15:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-02-15 11:15:00,436 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2019-02-15 11:15:00,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:00,436 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-02-15 11:15:00,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-15 11:15:00,436 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-02-15 11:15:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-15 11:15:00,437 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:00,437 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1] [2019-02-15 11:15:00,437 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:00,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:00,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1906113844, now seen corresponding path program 47 times [2019-02-15 11:15:00,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:00,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:00,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:00,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:00,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:01,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:01,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:01,007 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:01,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:01,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:01,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:01,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:15:01,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:15:01,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-15 11:15:01,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:01,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:01,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:02,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:02,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:02,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2019-02-15 11:15:02,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:02,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-15 11:15:02,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-15 11:15:02,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-02-15 11:15:02,239 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 35 states. [2019-02-15 11:15:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:02,908 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-02-15 11:15:02,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-15 11:15:02,908 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-02-15 11:15:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:02,909 INFO L225 Difference]: With dead ends: 71 [2019-02-15 11:15:02,909 INFO L226 Difference]: Without dead ends: 69 [2019-02-15 11:15:02,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 64 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-02-15 11:15:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-15 11:15:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-15 11:15:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-15 11:15:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-02-15 11:15:02,946 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 67 [2019-02-15 11:15:02,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:02,946 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-02-15 11:15:02,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-15 11:15:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-02-15 11:15:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-15 11:15:02,947 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:02,947 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-02-15 11:15:02,947 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:02,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:02,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 48 times [2019-02-15 11:15:02,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:02,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:02,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:02,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:02,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:05,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:05,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:05,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:05,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:05,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:05,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:05,932 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:15:05,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:15:05,972 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:15:05,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:05,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:08,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:15:08,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:15:08,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:15:08,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:15:08,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-15 11:15:08,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:09,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:15:09,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:15:09,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:15:09,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:15:12,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-15 11:15:12,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:12,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 35, 35] total 134 [2019-02-15 11:15:12,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:12,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-15 11:15:12,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-15 11:15:12,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2378, Invalid=15444, Unknown=0, NotChecked=0, Total=17822 [2019-02-15 11:15:12,116 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 101 states. [2019-02-15 11:15:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:20,044 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2019-02-15 11:15:20,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-15 11:15:20,045 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 68 [2019-02-15 11:15:20,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:20,046 INFO L225 Difference]: With dead ends: 107 [2019-02-15 11:15:20,046 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 11:15:20,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=3787, Invalid=25283, Unknown=0, NotChecked=0, Total=29070 [2019-02-15 11:15:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 11:15:20,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-15 11:15:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-15 11:15:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-02-15 11:15:20,086 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-02-15 11:15:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:20,086 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-02-15 11:15:20,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-15 11:15:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-02-15 11:15:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-15 11:15:20,086 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:20,087 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-02-15 11:15:20,087 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:20,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:20,087 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 49 times [2019-02-15 11:15:20,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:20,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:20,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:20,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:20,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:22,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:22,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:22,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:22,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:22,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:22,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:22,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:22,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:15:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:22,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:25,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:15:25,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:15:25,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:15:25,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:15:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:25,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:25,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:15:25,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:15:25,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:15:25,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:15:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:26,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:26,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 105 [2019-02-15 11:15:26,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:26,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-15 11:15:26,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-15 11:15:26,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2019-02-15 11:15:26,706 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 106 states. [2019-02-15 11:15:29,148 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-02-15 11:15:33,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:33,555 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-02-15 11:15:33,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-15 11:15:33,555 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 70 [2019-02-15 11:15:33,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:33,556 INFO L225 Difference]: With dead ends: 108 [2019-02-15 11:15:33,556 INFO L226 Difference]: Without dead ends: 72 [2019-02-15 11:15:33,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 78 SyntacticMatches, 25 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3274 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2019-02-15 11:15:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-15 11:15:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-02-15 11:15:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-15 11:15:33,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-02-15 11:15:33,595 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2019-02-15 11:15:33,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:33,595 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-02-15 11:15:33,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-15 11:15:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-02-15 11:15:33,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-15 11:15:33,596 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:33,596 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1] [2019-02-15 11:15:33,596 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:33,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:33,597 INFO L82 PathProgramCache]: Analyzing trace with hash -227129428, now seen corresponding path program 50 times [2019-02-15 11:15:33,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:33,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:33,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:33,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:33,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:35,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:35,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:35,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:35,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:35,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:35,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:35,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:15:35,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:15:35,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-15 11:15:35,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:35,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:35,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:36,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:36,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2019-02-15 11:15:36,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:36,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-15 11:15:36,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-15 11:15:36,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-02-15 11:15:36,694 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 37 states. [2019-02-15 11:15:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:37,360 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-02-15 11:15:37,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-15 11:15:37,360 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-02-15 11:15:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:37,361 INFO L225 Difference]: With dead ends: 75 [2019-02-15 11:15:37,361 INFO L226 Difference]: Without dead ends: 73 [2019-02-15 11:15:37,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 107 SyntacticMatches, 68 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-02-15 11:15:37,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-15 11:15:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-15 11:15:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-15 11:15:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-02-15 11:15:37,400 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2019-02-15 11:15:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:37,401 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-02-15 11:15:37,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-15 11:15:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-02-15 11:15:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-15 11:15:37,401 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:37,401 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-02-15 11:15:37,401 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:37,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:37,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 51 times [2019-02-15 11:15:37,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:37,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:37,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:40,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:40,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:40,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:40,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:40,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:40,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:40,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:15:40,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:15:40,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:15:40,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:40,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:43,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:15:43,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:15:43,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:15:43,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:15:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-15 11:15:43,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:43,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:15:43,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:15:43,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:15:43,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:15:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-15 11:15:47,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:47,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 37, 37] total 142 [2019-02-15 11:15:47,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:47,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-15 11:15:47,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-15 11:15:47,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2662, Invalid=17360, Unknown=0, NotChecked=0, Total=20022 [2019-02-15 11:15:47,303 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 107 states. [2019-02-15 11:15:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:55,583 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-02-15 11:15:55,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-02-15 11:15:55,584 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 72 [2019-02-15 11:15:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:55,585 INFO L225 Difference]: With dead ends: 113 [2019-02-15 11:15:55,585 INFO L226 Difference]: Without dead ends: 75 [2019-02-15 11:15:55,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=4225, Invalid=28355, Unknown=0, NotChecked=0, Total=32580 [2019-02-15 11:15:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-15 11:15:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-15 11:15:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-15 11:15:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-02-15 11:15:55,628 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-02-15 11:15:55,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:55,628 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-02-15 11:15:55,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-15 11:15:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-02-15 11:15:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-15 11:15:55,629 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:55,629 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-02-15 11:15:55,629 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:55,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:55,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 52 times [2019-02-15 11:15:55,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:55,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:55,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:55,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:55,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:59,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:59,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:59,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:59,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:59,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:59,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:59,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:59,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:15:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:59,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:02,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:16:02,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:16:02,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:16:02,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:16:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:02,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:02,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:16:02,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:16:02,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:16:02,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:16:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:03,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:03,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 111 [2019-02-15 11:16:03,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:03,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-15 11:16:03,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-15 11:16:03,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=12101, Unknown=0, NotChecked=0, Total=12432 [2019-02-15 11:16:03,741 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 112 states. [2019-02-15 11:16:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:10,582 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-02-15 11:16:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-15 11:16:10,582 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 74 [2019-02-15 11:16:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:10,582 INFO L225 Difference]: With dead ends: 114 [2019-02-15 11:16:10,583 INFO L226 Difference]: Without dead ends: 76 [2019-02-15 11:16:10,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 83 SyntacticMatches, 26 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3645 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=700, Invalid=21650, Unknown=0, NotChecked=0, Total=22350 [2019-02-15 11:16:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-15 11:16:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-02-15 11:16:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-15 11:16:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-02-15 11:16:10,624 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-02-15 11:16:10,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:10,625 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-02-15 11:16:10,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-15 11:16:10,625 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-02-15 11:16:10,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-15 11:16:10,625 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:10,625 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1] [2019-02-15 11:16:10,626 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:10,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:10,626 INFO L82 PathProgramCache]: Analyzing trace with hash -2146155380, now seen corresponding path program 53 times [2019-02-15 11:16:10,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:10,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:10,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:16:10,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:10,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:11,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:11,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:11,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:11,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:11,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:11,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:16:11,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:16:11,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:16:11,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-15 11:16:11,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:11,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:11,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:12,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:12,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2019-02-15 11:16:12,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:12,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-15 11:16:12,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-15 11:16:12,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-02-15 11:16:12,905 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 39 states. [2019-02-15 11:16:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:13,650 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-02-15 11:16:13,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-15 11:16:13,650 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-02-15 11:16:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:13,651 INFO L225 Difference]: With dead ends: 79 [2019-02-15 11:16:13,651 INFO L226 Difference]: Without dead ends: 77 [2019-02-15 11:16:13,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 113 SyntacticMatches, 72 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-02-15 11:16:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-15 11:16:13,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-15 11:16:13,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-15 11:16:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-02-15 11:16:13,711 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 75 [2019-02-15 11:16:13,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:13,711 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-02-15 11:16:13,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-15 11:16:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-02-15 11:16:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-15 11:16:13,712 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:13,712 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-02-15 11:16:13,712 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:13,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:13,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 54 times [2019-02-15 11:16:13,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:13,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:13,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:16:13,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:13,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:16,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:16,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:16,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:16,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:16,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:16,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:16:16,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:16:16,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:16:16,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:16:16,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:16,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:20,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:16:20,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:16:20,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:16:20,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:16:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-15 11:16:20,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:20,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:16:20,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:16:20,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:16:20,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:16:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-15 11:16:24,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:24,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 39, 39] total 150 [2019-02-15 11:16:24,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:24,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-15 11:16:24,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-15 11:16:24,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2962, Invalid=19388, Unknown=0, NotChecked=0, Total=22350 [2019-02-15 11:16:24,216 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 113 states. [2019-02-15 11:16:33,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:33,756 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2019-02-15 11:16:33,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-02-15 11:16:33,756 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 76 [2019-02-15 11:16:33,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:33,757 INFO L225 Difference]: With dead ends: 119 [2019-02-15 11:16:33,757 INFO L226 Difference]: Without dead ends: 79 [2019-02-15 11:16:33,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=4687, Invalid=31603, Unknown=0, NotChecked=0, Total=36290 [2019-02-15 11:16:33,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-15 11:16:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-15 11:16:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-15 11:16:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-02-15 11:16:33,820 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-02-15 11:16:33,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:33,821 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-02-15 11:16:33,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-15 11:16:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-02-15 11:16:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-15 11:16:33,821 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:33,822 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-02-15 11:16:33,822 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:33,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:33,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 55 times [2019-02-15 11:16:33,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:33,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:33,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:16:33,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:33,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:37,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:37,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:37,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:37,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:37,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:37,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:16:37,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:16:37,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:16:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:38,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:41,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:16:41,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:16:41,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:16:41,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:16:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:41,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:41,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:16:41,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:16:41,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:16:41,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:16:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:42,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:42,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 117 [2019-02-15 11:16:42,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:42,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-15 11:16:42,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-15 11:16:42,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=13457, Unknown=0, NotChecked=0, Total=13806 [2019-02-15 11:16:42,946 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 118 states. [2019-02-15 11:16:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:51,179 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-02-15 11:16:51,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-15 11:16:51,180 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 78 [2019-02-15 11:16:51,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:51,181 INFO L225 Difference]: With dead ends: 120 [2019-02-15 11:16:51,181 INFO L226 Difference]: Without dead ends: 80 [2019-02-15 11:16:51,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 89 SyntacticMatches, 26 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3995 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=738, Invalid=24068, Unknown=0, NotChecked=0, Total=24806 [2019-02-15 11:16:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-15 11:16:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-02-15 11:16:51,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-15 11:16:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-02-15 11:16:51,232 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2019-02-15 11:16:51,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:51,232 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-02-15 11:16:51,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-15 11:16:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-02-15 11:16:51,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-15 11:16:51,233 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:51,233 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1] [2019-02-15 11:16:51,234 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:51,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:51,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1169619308, now seen corresponding path program 56 times [2019-02-15 11:16:51,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:51,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:16:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:51,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:52,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:52,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:52,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:52,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:52,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:52,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:16:52,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:16:52,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:16:52,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-15 11:16:52,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:52,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:52,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:53,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:53,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2019-02-15 11:16:53,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:53,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-15 11:16:53,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-15 11:16:53,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-02-15 11:16:53,666 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 41 states. [2019-02-15 11:16:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:54,483 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-02-15 11:16:54,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-15 11:16:54,484 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-02-15 11:16:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:54,484 INFO L225 Difference]: With dead ends: 83 [2019-02-15 11:16:54,485 INFO L226 Difference]: Without dead ends: 81 [2019-02-15 11:16:54,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 119 SyntacticMatches, 76 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-02-15 11:16:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-15 11:16:54,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-15 11:16:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-15 11:16:54,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-02-15 11:16:54,541 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 79 [2019-02-15 11:16:54,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:54,542 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-02-15 11:16:54,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-15 11:16:54,542 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-02-15 11:16:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-15 11:16:54,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:54,542 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-02-15 11:16:54,543 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:54,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:54,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 57 times [2019-02-15 11:16:54,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:54,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:54,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:16:54,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:54,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:57,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:57,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:57,794 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:57,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:57,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:57,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:16:57,804 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:16:57,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:16:57,852 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:16:57,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:57,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:03,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:17:03,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:17:03,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:17:03,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:17:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-15 11:17:03,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:03,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:17:03,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:17:04,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:17:04,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:17:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-15 11:17:08,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:08,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 41, 41] total 158 [2019-02-15 11:17:08,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:08,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-15 11:17:08,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-15 11:17:08,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3278, Invalid=21528, Unknown=0, NotChecked=0, Total=24806 [2019-02-15 11:17:08,299 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 119 states. [2019-02-15 11:17:18,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:18,530 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-02-15 11:17:18,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-02-15 11:17:18,530 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 80 [2019-02-15 11:17:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:18,531 INFO L225 Difference]: With dead ends: 125 [2019-02-15 11:17:18,531 INFO L226 Difference]: Without dead ends: 83 [2019-02-15 11:17:18,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=5173, Invalid=35027, Unknown=0, NotChecked=0, Total=40200 [2019-02-15 11:17:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-15 11:17:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-15 11:17:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-15 11:17:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-02-15 11:17:18,591 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-02-15 11:17:18,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:18,591 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-02-15 11:17:18,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-15 11:17:18,591 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-02-15 11:17:18,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-15 11:17:18,591 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:18,592 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-02-15 11:17:18,592 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:18,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:18,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 58 times [2019-02-15 11:17:18,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:18,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:18,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:17:18,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:18,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:22,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:22,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:22,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:22,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:22,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:22,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:17:22,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:17:22,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:17:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:22,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:26,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:17:26,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:17:26,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:17:26,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:17:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:26,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:26,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:17:26,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:17:26,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:17:26,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:17:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:27,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:27,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 123 [2019-02-15 11:17:27,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:27,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-15 11:17:27,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-15 11:17:27,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=14885, Unknown=0, NotChecked=0, Total=15252 [2019-02-15 11:17:27,910 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 124 states. [2019-02-15 11:17:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:36,730 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2019-02-15 11:17:36,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-15 11:17:36,731 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 82 [2019-02-15 11:17:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:36,732 INFO L225 Difference]: With dead ends: 126 [2019-02-15 11:17:36,732 INFO L226 Difference]: Without dead ends: 84 [2019-02-15 11:17:36,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 93 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4447 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=776, Invalid=26614, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 11:17:36,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-15 11:17:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-02-15 11:17:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-15 11:17:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-02-15 11:17:36,784 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2019-02-15 11:17:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:36,785 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-02-15 11:17:36,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-15 11:17:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-02-15 11:17:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-15 11:17:36,785 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:36,785 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1] [2019-02-15 11:17:36,785 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:36,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:36,786 INFO L82 PathProgramCache]: Analyzing trace with hash 928540236, now seen corresponding path program 59 times [2019-02-15 11:17:36,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:36,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:36,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:17:36,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:36,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:38,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:38,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:38,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:38,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:38,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:38,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:17:38,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:17:38,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:17:38,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-15 11:17:38,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:17:38,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:38,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:39,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:39,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2019-02-15 11:17:39,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:39,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-15 11:17:39,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-15 11:17:39,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-02-15 11:17:39,609 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 43 states. [2019-02-15 11:17:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:40,453 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-02-15 11:17:40,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-15 11:17:40,454 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-02-15 11:17:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:40,455 INFO L225 Difference]: With dead ends: 87 [2019-02-15 11:17:40,455 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 11:17:40,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 125 SyntacticMatches, 80 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-02-15 11:17:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 11:17:40,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-15 11:17:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-15 11:17:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-02-15 11:17:40,512 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2019-02-15 11:17:40,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:40,512 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-02-15 11:17:40,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-15 11:17:40,512 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-02-15 11:17:40,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-15 11:17:40,513 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:40,513 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-02-15 11:17:40,513 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:40,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:40,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 60 times [2019-02-15 11:17:40,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:40,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:40,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:17:40,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:40,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:44,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:44,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:44,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:44,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:44,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:44,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:17:44,052 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:17:44,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:17:44,101 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:17:44,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:17:44,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:48,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:17:48,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:17:48,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:17:48,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:17:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-15 11:17:48,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:48,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:17:48,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:17:48,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:17:48,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:17:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-15 11:17:53,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:53,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 43, 43] total 166 [2019-02-15 11:17:53,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:53,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-02-15 11:17:53,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-02-15 11:17:53,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3610, Invalid=23780, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 11:17:53,307 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 125 states. [2019-02-15 11:18:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:04,508 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-02-15 11:18:04,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-02-15 11:18:04,509 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 84 [2019-02-15 11:18:04,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:04,510 INFO L225 Difference]: With dead ends: 131 [2019-02-15 11:18:04,510 INFO L226 Difference]: Without dead ends: 87 [2019-02-15 11:18:04,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=5683, Invalid=38627, Unknown=0, NotChecked=0, Total=44310 [2019-02-15 11:18:04,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-15 11:18:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-15 11:18:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-15 11:18:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-02-15 11:18:04,576 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-02-15 11:18:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:04,576 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-02-15 11:18:04,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-02-15 11:18:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-02-15 11:18:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-15 11:18:04,577 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:04,577 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-02-15 11:18:04,577 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:04,577 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 61 times [2019-02-15 11:18:04,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:04,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:04,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:18:04,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:04,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:08,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:08,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:08,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:08,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:08,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:08,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:18:08,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:18:08,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:18:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:08,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:12,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:18:12,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:18:12,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:18:12,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:18:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:12,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:12,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:18:12,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:18:12,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:18:12,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:18:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:14,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:14,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 129 [2019-02-15 11:18:14,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:14,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-15 11:18:14,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-15 11:18:14,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=16385, Unknown=0, NotChecked=0, Total=16770 [2019-02-15 11:18:14,256 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 130 states. [2019-02-15 11:18:23,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:23,871 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2019-02-15 11:18:23,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-15 11:18:23,872 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 86 [2019-02-15 11:18:23,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:23,872 INFO L225 Difference]: With dead ends: 132 [2019-02-15 11:18:23,872 INFO L226 Difference]: Without dead ends: 88 [2019-02-15 11:18:23,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 97 SyntacticMatches, 30 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=814, Invalid=29288, Unknown=0, NotChecked=0, Total=30102 [2019-02-15 11:18:23,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-02-15 11:18:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-02-15 11:18:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-15 11:18:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-02-15 11:18:23,935 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-02-15 11:18:23,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:23,935 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-02-15 11:18:23,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-15 11:18:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-02-15 11:18:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-15 11:18:23,936 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:23,936 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1] [2019-02-15 11:18:23,936 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:23,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:23,937 INFO L82 PathProgramCache]: Analyzing trace with hash -831354068, now seen corresponding path program 62 times [2019-02-15 11:18:23,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:23,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:23,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:18:23,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:23,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:24,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:24,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:24,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:24,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:24,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:24,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:18:24,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:18:24,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:18:25,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-15 11:18:25,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:18:25,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:25,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:26,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:26,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2019-02-15 11:18:26,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:26,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-15 11:18:26,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-15 11:18:26,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-02-15 11:18:26,428 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 45 states. [2019-02-15 11:18:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:27,358 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-02-15 11:18:27,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-15 11:18:27,359 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-02-15 11:18:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:27,359 INFO L225 Difference]: With dead ends: 91 [2019-02-15 11:18:27,359 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 11:18:27,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 131 SyntacticMatches, 84 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-02-15 11:18:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 11:18:27,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-15 11:18:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-15 11:18:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-02-15 11:18:27,452 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 87 [2019-02-15 11:18:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:27,453 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-02-15 11:18:27,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-15 11:18:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-02-15 11:18:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-15 11:18:27,454 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:27,454 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-02-15 11:18:27,454 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:27,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:27,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 63 times [2019-02-15 11:18:27,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:27,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:27,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:18:27,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:27,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:31,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:31,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:31,501 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:31,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:31,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:31,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:18:31,512 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:18:31,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:18:31,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:18:31,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:18:31,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:36,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:18:36,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:18:36,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:18:36,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:18:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-15 11:18:36,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:36,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:18:36,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:18:36,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:18:36,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:18:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-15 11:18:41,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:41,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 45, 45] total 174 [2019-02-15 11:18:41,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:41,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-15 11:18:41,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-15 11:18:41,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3958, Invalid=26144, Unknown=0, NotChecked=0, Total=30102 [2019-02-15 11:18:41,651 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 131 states. [2019-02-15 11:18:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:54,020 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2019-02-15 11:18:54,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-02-15 11:18:54,020 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 88 [2019-02-15 11:18:54,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:54,021 INFO L225 Difference]: With dead ends: 137 [2019-02-15 11:18:54,021 INFO L226 Difference]: Without dead ends: 91 [2019-02-15 11:18:54,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=6217, Invalid=42403, Unknown=0, NotChecked=0, Total=48620 [2019-02-15 11:18:54,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-15 11:18:54,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-15 11:18:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-15 11:18:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-02-15 11:18:54,082 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-02-15 11:18:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:54,082 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-02-15 11:18:54,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-15 11:18:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-02-15 11:18:54,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-15 11:18:54,082 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:54,083 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-02-15 11:18:54,083 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:54,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:54,083 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 64 times [2019-02-15 11:18:54,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:54,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:54,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:18:54,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:54,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:57,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:57,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:57,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:57,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:57,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:57,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:18:57,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:18:57,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:18:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:57,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:02,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:19:02,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:19:02,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:19:02,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:19:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:02,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:02,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:19:02,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:19:02,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:19:02,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:19:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:04,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:04,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 135 [2019-02-15 11:19:04,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:04,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-15 11:19:04,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-15 11:19:04,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=17957, Unknown=0, NotChecked=0, Total=18360 [2019-02-15 11:19:04,387 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 136 states. [2019-02-15 11:19:15,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:15,194 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2019-02-15 11:19:15,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-15 11:19:15,194 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 90 [2019-02-15 11:19:15,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:15,195 INFO L225 Difference]: With dead ends: 138 [2019-02-15 11:19:15,195 INFO L226 Difference]: Without dead ends: 92 [2019-02-15 11:19:15,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 102 SyntacticMatches, 31 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5376 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=852, Invalid=32090, Unknown=0, NotChecked=0, Total=32942 [2019-02-15 11:19:15,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-15 11:19:15,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-02-15 11:19:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-15 11:19:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-02-15 11:19:15,256 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2019-02-15 11:19:15,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:15,256 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-02-15 11:19:15,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-15 11:19:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-02-15 11:19:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-15 11:19:15,256 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:15,256 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1] [2019-02-15 11:19:15,257 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:15,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:15,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1442879476, now seen corresponding path program 65 times [2019-02-15 11:19:15,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:15,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:15,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:19:15,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:15,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:16,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:16,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:16,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:16,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:16,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:16,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:19:16,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:19:16,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:19:16,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-15 11:19:16,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:19:16,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:16,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:17,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:17,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2019-02-15 11:19:17,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:17,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-15 11:19:17,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-15 11:19:17,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-02-15 11:19:17,903 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 47 states. [2019-02-15 11:19:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:18,951 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-02-15 11:19:18,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-15 11:19:18,951 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-02-15 11:19:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:18,951 INFO L225 Difference]: With dead ends: 95 [2019-02-15 11:19:18,952 INFO L226 Difference]: Without dead ends: 93 [2019-02-15 11:19:18,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 137 SyntacticMatches, 88 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2019-02-15 11:19:18,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-15 11:19:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-15 11:19:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-15 11:19:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-02-15 11:19:19,013 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 91 [2019-02-15 11:19:19,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:19,013 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-02-15 11:19:19,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-15 11:19:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-02-15 11:19:19,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-15 11:19:19,014 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:19,014 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-02-15 11:19:19,014 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:19,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:19,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 66 times [2019-02-15 11:19:19,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:19,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:19,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:19:19,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:19,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:23,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:23,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:23,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:23,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:23,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:23,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:19:23,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:19:23,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:19:23,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:19:23,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:19:23,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:28,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:19:28,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:19:28,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:19:28,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:19:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-15 11:19:28,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:28,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:19:28,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:19:28,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:19:28,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:19:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-15 11:19:34,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:34,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 47, 47] total 182 [2019-02-15 11:19:34,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:34,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-02-15 11:19:34,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-02-15 11:19:34,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4322, Invalid=28620, Unknown=0, NotChecked=0, Total=32942 [2019-02-15 11:19:34,117 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 137 states. [2019-02-15 11:19:47,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:47,129 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2019-02-15 11:19:47,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-02-15 11:19:47,129 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 92 [2019-02-15 11:19:47,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:47,130 INFO L225 Difference]: With dead ends: 143 [2019-02-15 11:19:47,130 INFO L226 Difference]: Without dead ends: 95 [2019-02-15 11:19:47,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=6775, Invalid=46355, Unknown=0, NotChecked=0, Total=53130 [2019-02-15 11:19:47,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-15 11:19:47,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-15 11:19:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-15 11:19:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-02-15 11:19:47,195 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-02-15 11:19:47,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:47,195 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-02-15 11:19:47,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-02-15 11:19:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-02-15 11:19:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-15 11:19:47,196 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:47,196 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-02-15 11:19:47,196 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:47,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:47,196 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 67 times [2019-02-15 11:19:47,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:47,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:47,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:19:47,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:47,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:51,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:51,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:51,468 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:51,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:51,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:51,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:19:51,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:19:51,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:19:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:51,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:56,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:19:56,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:19:56,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:19:56,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:19:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:56,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:56,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:19:56,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:19:56,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:19:56,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:19:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:58,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:58,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 141 [2019-02-15 11:19:58,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:58,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-15 11:19:58,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-15 11:19:58,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=19601, Unknown=0, NotChecked=0, Total=20022 [2019-02-15 11:19:58,649 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 142 states. [2019-02-15 11:20:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:20:10,472 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2019-02-15 11:20:10,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-15 11:20:10,473 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 94 [2019-02-15 11:20:10,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:20:10,474 INFO L225 Difference]: With dead ends: 144 [2019-02-15 11:20:10,474 INFO L226 Difference]: Without dead ends: 96 [2019-02-15 11:20:10,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 106 SyntacticMatches, 33 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5898 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=890, Invalid=35020, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 11:20:10,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-02-15 11:20:10,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-02-15 11:20:10,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-15 11:20:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-02-15 11:20:10,538 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2019-02-15 11:20:10,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:20:10,538 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-02-15 11:20:10,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-15 11:20:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-02-15 11:20:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-15 11:20:10,539 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:20:10,539 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1] [2019-02-15 11:20:10,539 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:20:10,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:20:10,539 INFO L82 PathProgramCache]: Analyzing trace with hash 779681004, now seen corresponding path program 68 times [2019-02-15 11:20:10,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:20:10,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:10,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:20:10,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:10,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:20:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:11,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:11,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:20:11,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:20:11,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:20:11,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:11,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:20:11,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:20:11,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:20:12,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-15 11:20:12,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:20:12,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:20:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:12,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:20:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:13,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:20:13,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2019-02-15 11:20:13,819 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:20:13,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-15 11:20:13,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-15 11:20:13,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-02-15 11:20:13,820 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 49 states. [2019-02-15 11:20:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:20:14,885 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-02-15 11:20:14,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-15 11:20:14,885 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-02-15 11:20:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:20:14,885 INFO L225 Difference]: With dead ends: 99 [2019-02-15 11:20:14,886 INFO L226 Difference]: Without dead ends: 97 [2019-02-15 11:20:14,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 143 SyntacticMatches, 92 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-02-15 11:20:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-15 11:20:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-15 11:20:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-15 11:20:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-02-15 11:20:14,952 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2019-02-15 11:20:14,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:20:14,953 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-02-15 11:20:14,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-15 11:20:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-02-15 11:20:14,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-15 11:20:14,953 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:20:14,953 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-02-15 11:20:14,953 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:20:14,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:20:14,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 69 times [2019-02-15 11:20:14,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:20:14,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:14,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:20:14,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:14,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:20:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:19,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:19,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:20:19,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:20:19,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:20:19,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:19,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:20:19,442 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:20:19,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:20:19,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:20:19,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:20:19,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:20:24,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:20:24,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:20:24,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:20:24,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:20:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-15 11:20:24,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:20:25,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:20:25,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:20:25,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:20:25,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:20:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-15 11:20:31,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:20:31,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 49, 49] total 190 [2019-02-15 11:20:31,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:20:31,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-02-15 11:20:31,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-02-15 11:20:31,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4702, Invalid=31208, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 11:20:31,128 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 143 states. [2019-02-15 11:20:45,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:20:45,900 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2019-02-15 11:20:45,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-02-15 11:20:45,900 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 96 [2019-02-15 11:20:45,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:20:45,901 INFO L225 Difference]: With dead ends: 149 [2019-02-15 11:20:45,901 INFO L226 Difference]: Without dead ends: 99 [2019-02-15 11:20:45,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=7357, Invalid=50483, Unknown=0, NotChecked=0, Total=57840 [2019-02-15 11:20:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-15 11:20:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-15 11:20:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-15 11:20:45,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-02-15 11:20:45,972 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-02-15 11:20:45,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:20:45,972 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-02-15 11:20:45,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-02-15 11:20:45,972 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-02-15 11:20:45,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-15 11:20:45,973 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:20:45,973 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-02-15 11:20:45,973 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:20:45,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:20:45,973 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 70 times [2019-02-15 11:20:45,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:20:45,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:45,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:20:45,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:45,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:20:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:50,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:50,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:20:50,578 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:20:50,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:20:50,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:50,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:20:50,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:20:50,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:20:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:50,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:20:56,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:20:56,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:20:56,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:20:56,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:20:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:56,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:20:56,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:20:56,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:20:56,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:20:56,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:20:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:58,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:20:58,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 147 [2019-02-15 11:20:58,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:20:58,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-15 11:20:58,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-15 11:20:58,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=21317, Unknown=0, NotChecked=0, Total=21756 [2019-02-15 11:20:58,555 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 148 states. [2019-02-15 11:21:09,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:21:09,716 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2019-02-15 11:21:09,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-15 11:21:09,717 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 98 [2019-02-15 11:21:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:21:09,717 INFO L225 Difference]: With dead ends: 150 [2019-02-15 11:21:09,718 INFO L226 Difference]: Without dead ends: 100 [2019-02-15 11:21:09,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 110 SyntacticMatches, 35 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6444 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=928, Invalid=38078, Unknown=0, NotChecked=0, Total=39006 [2019-02-15 11:21:09,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-15 11:21:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-02-15 11:21:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-15 11:21:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-02-15 11:21:09,786 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-02-15 11:21:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:21:09,787 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-02-15 11:21:09,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-15 11:21:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-02-15 11:21:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-15 11:21:09,787 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:21:09,787 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1] [2019-02-15 11:21:09,788 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:21:09,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:21:09,788 INFO L82 PathProgramCache]: Analyzing trace with hash 634997196, now seen corresponding path program 71 times [2019-02-15 11:21:09,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:21:09,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:09,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:21:09,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:09,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:21:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:10,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:10,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:21:10,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:21:10,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:21:10,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:10,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:21:10,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:21:10,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:21:11,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-15 11:21:11,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:21:11,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:21:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:11,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:21:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:13,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:21:13,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2019-02-15 11:21:13,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:21:13,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-15 11:21:13,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-15 11:21:13,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-02-15 11:21:13,085 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 51 states. [2019-02-15 11:21:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:21:14,224 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-02-15 11:21:14,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-15 11:21:14,224 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-02-15 11:21:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:21:14,224 INFO L225 Difference]: With dead ends: 103 [2019-02-15 11:21:14,225 INFO L226 Difference]: Without dead ends: 101 [2019-02-15 11:21:14,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 149 SyntacticMatches, 96 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-02-15 11:21:14,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-15 11:21:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-15 11:21:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-15 11:21:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-02-15 11:21:14,298 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 99 [2019-02-15 11:21:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:21:14,298 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-02-15 11:21:14,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-15 11:21:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-02-15 11:21:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-15 11:21:14,298 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:21:14,299 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-02-15 11:21:14,299 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:21:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:21:14,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 72 times [2019-02-15 11:21:14,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:21:14,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:14,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:21:14,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:14,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:21:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:18,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:18,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:21:18,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:21:18,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:21:18,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:18,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:21:18,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:21:18,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:21:19,059 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:21:19,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:21:19,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:21:24,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:21:24,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:21:24,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:21:24,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:21:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-15 11:21:24,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:21:25,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:21:25,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:21:25,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:21:25,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:21:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-15 11:21:31,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:21:31,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 51, 51] total 198 [2019-02-15 11:21:31,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:21:31,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-02-15 11:21:31,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-02-15 11:21:31,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5098, Invalid=33908, Unknown=0, NotChecked=0, Total=39006 [2019-02-15 11:21:31,658 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 149 states. [2019-02-15 11:21:47,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:21:47,352 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2019-02-15 11:21:47,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-02-15 11:21:47,352 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 100 [2019-02-15 11:21:47,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:21:47,353 INFO L225 Difference]: With dead ends: 155 [2019-02-15 11:21:47,354 INFO L226 Difference]: Without dead ends: 103 [2019-02-15 11:21:47,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=7963, Invalid=54787, Unknown=0, NotChecked=0, Total=62750 [2019-02-15 11:21:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-15 11:21:47,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-15 11:21:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-15 11:21:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-02-15 11:21:47,429 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-02-15 11:21:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:21:47,429 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-02-15 11:21:47,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-02-15 11:21:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-02-15 11:21:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-15 11:21:47,429 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:21:47,430 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-02-15 11:21:47,430 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:21:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:21:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 73 times [2019-02-15 11:21:47,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:21:47,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:47,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:21:47,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:47,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:21:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:52,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:52,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:21:52,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:21:52,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:21:52,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:52,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:21:52,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:21:52,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:21:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:52,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:21:58,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:21:58,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:21:58,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:21:58,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:21:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:58,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:21:58,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:21:58,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:21:58,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:21:58,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:22:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:01,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:22:01,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 153 [2019-02-15 11:22:01,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:22:01,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-15 11:22:01,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-15 11:22:01,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=23105, Unknown=0, NotChecked=0, Total=23562 [2019-02-15 11:22:01,222 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 154 states. [2019-02-15 11:22:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:22:13,277 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-02-15 11:22:13,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-15 11:22:13,277 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 102 [2019-02-15 11:22:13,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:22:13,278 INFO L225 Difference]: With dead ends: 156 [2019-02-15 11:22:13,279 INFO L226 Difference]: Without dead ends: 104 [2019-02-15 11:22:13,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 114 SyntacticMatches, 37 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7014 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=966, Invalid=41264, Unknown=0, NotChecked=0, Total=42230 [2019-02-15 11:22:13,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-15 11:22:13,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-02-15 11:22:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-15 11:22:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-02-15 11:22:13,359 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2019-02-15 11:22:13,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:22:13,359 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-02-15 11:22:13,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-15 11:22:13,360 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-02-15 11:22:13,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-15 11:22:13,360 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:22:13,360 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1] [2019-02-15 11:22:13,360 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:22:13,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:22:13,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1603948204, now seen corresponding path program 74 times [2019-02-15 11:22:13,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:22:13,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:13,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:22:13,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:13,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:22:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:14,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:14,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:22:14,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:22:14,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:22:14,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:14,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:22:14,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:22:14,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:22:15,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-15 11:22:15,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:22:15,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:22:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:15,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:22:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:17,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:22:17,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-02-15 11:22:17,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:22:17,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-15 11:22:17,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-15 11:22:17,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-02-15 11:22:17,032 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 53 states. [2019-02-15 11:22:18,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:22:18,280 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-02-15 11:22:18,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-15 11:22:18,280 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-02-15 11:22:18,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:22:18,281 INFO L225 Difference]: With dead ends: 107 [2019-02-15 11:22:18,281 INFO L226 Difference]: Without dead ends: 105 [2019-02-15 11:22:18,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 155 SyntacticMatches, 100 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2019-02-15 11:22:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-15 11:22:18,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-15 11:22:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-15 11:22:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-02-15 11:22:18,365 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 103 [2019-02-15 11:22:18,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:22:18,365 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-02-15 11:22:18,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-15 11:22:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-02-15 11:22:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-15 11:22:18,366 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:22:18,366 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-02-15 11:22:18,366 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:22:18,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:22:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 75 times [2019-02-15 11:22:18,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:22:18,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:18,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:22:18,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:18,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:22:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:23,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:23,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:22:23,554 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:22:23,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:22:23,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:23,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:22:23,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:22:23,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:22:23,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:22:23,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:22:23,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:22:29,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:22:29,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:22:29,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:22:29,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:22:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-15 11:22:30,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:22:30,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:22:30,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:22:30,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:22:30,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:22:37,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-15 11:22:37,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:22:37,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 53, 53] total 206 [2019-02-15 11:22:37,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:22:37,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-02-15 11:22:37,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-02-15 11:22:37,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5510, Invalid=36720, Unknown=0, NotChecked=0, Total=42230 [2019-02-15 11:22:37,303 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 155 states. [2019-02-15 11:22:53,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:22:53,381 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2019-02-15 11:22:53,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-02-15 11:22:53,382 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 104 [2019-02-15 11:22:53,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:22:53,382 INFO L225 Difference]: With dead ends: 161 [2019-02-15 11:22:53,382 INFO L226 Difference]: Without dead ends: 107 [2019-02-15 11:22:53,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5458 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=8593, Invalid=59267, Unknown=0, NotChecked=0, Total=67860 [2019-02-15 11:22:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-15 11:22:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-15 11:22:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-15 11:22:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-02-15 11:22:53,464 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-02-15 11:22:53,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:22:53,464 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-02-15 11:22:53,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-02-15 11:22:53,464 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-02-15 11:22:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-15 11:22:53,465 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:22:53,465 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-02-15 11:22:53,465 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:22:53,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:22:53,465 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 76 times [2019-02-15 11:22:53,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:22:53,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:53,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:22:53,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:53,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:22:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:58,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:58,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:22:58,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:22:58,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:22:58,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:58,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:22:58,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:22:58,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:22:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:59,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:23:05,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:23:05,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:23:05,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:23:05,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-15 11:23:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:05,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:23:05,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:23:05,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:23:05,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:23:05,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-15 11:23:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:08,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:23:08,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 159 [2019-02-15 11:23:08,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:23:08,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-15 11:23:08,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-15 11:23:08,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=24965, Unknown=0, NotChecked=0, Total=25440 [2019-02-15 11:23:08,132 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 160 states. [2019-02-15 11:23:20,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:23:20,371 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2019-02-15 11:23:20,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-02-15 11:23:20,371 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 106 [2019-02-15 11:23:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:23:20,372 INFO L225 Difference]: With dead ends: 162 [2019-02-15 11:23:20,372 INFO L226 Difference]: Without dead ends: 108 [2019-02-15 11:23:20,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 118 SyntacticMatches, 39 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7608 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=1004, Invalid=44578, Unknown=0, NotChecked=0, Total=45582 [2019-02-15 11:23:20,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-15 11:23:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-02-15 11:23:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-15 11:23:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-02-15 11:23:20,458 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2019-02-15 11:23:20,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:23:20,459 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-02-15 11:23:20,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-15 11:23:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-02-15 11:23:20,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-15 11:23:20,459 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:23:20,459 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1] [2019-02-15 11:23:20,459 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:23:20,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:23:20,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1354107788, now seen corresponding path program 77 times [2019-02-15 11:23:20,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:23:20,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:20,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:23:20,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:20,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:23:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:23:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:21,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:21,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:23:21,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:23:21,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:23:21,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:21,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:23:21,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:23:21,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:23:22,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-15 11:23:22,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:23:22,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:23:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:22,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:23:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:24,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:23:24,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2019-02-15 11:23:24,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:23:24,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-15 11:23:24,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-15 11:23:24,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2019-02-15 11:23:24,258 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 55 states. [2019-02-15 11:23:25,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:23:25,790 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2019-02-15 11:23:25,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-15 11:23:25,791 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-02-15 11:23:25,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:23:25,791 INFO L225 Difference]: With dead ends: 111 [2019-02-15 11:23:25,792 INFO L226 Difference]: Without dead ends: 109 [2019-02-15 11:23:25,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 161 SyntacticMatches, 104 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2019-02-15 11:23:25,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-15 11:23:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-15 11:23:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-15 11:23:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-02-15 11:23:25,876 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2019-02-15 11:23:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:23:25,876 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-02-15 11:23:25,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-15 11:23:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-02-15 11:23:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-15 11:23:25,876 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:23:25,876 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-02-15 11:23:25,877 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:23:25,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:23:25,877 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 78 times [2019-02-15 11:23:25,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:23:25,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:25,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:23:25,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:25,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:23:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:23:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:31,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:31,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:23:31,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:23:31,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:23:31,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:31,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:23:31,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:23:31,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:23:31,446 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:23:31,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:23:31,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:23:37,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:23:37,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:23:37,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:23:37,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-15 11:23:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-15 11:23:38,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:23:38,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-02-15 11:23:38,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:23:38,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:23:38,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-02-15 11:23:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-15 11:23:45,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:23:45,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 55, 55] total 214 [2019-02-15 11:23:45,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:23:45,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-02-15 11:23:45,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-02-15 11:23:45,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5938, Invalid=39644, Unknown=0, NotChecked=0, Total=45582 [2019-02-15 11:23:45,792 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 161 states. [2019-02-15 11:24:03,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:24:03,329 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2019-02-15 11:24:03,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-02-15 11:24:03,329 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 108 [2019-02-15 11:24:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:24:03,330 INFO L225 Difference]: With dead ends: 167 [2019-02-15 11:24:03,330 INFO L226 Difference]: Without dead ends: 111 [2019-02-15 11:24:03,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5884 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=9247, Invalid=63923, Unknown=0, NotChecked=0, Total=73170 [2019-02-15 11:24:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-15 11:24:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-15 11:24:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-15 11:24:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-02-15 11:24:03,418 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-02-15 11:24:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:24:03,418 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-02-15 11:24:03,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-02-15 11:24:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-02-15 11:24:03,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-15 11:24:03,418 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:03,419 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-02-15 11:24:03,419 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:03,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:03,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 79 times [2019-02-15 11:24:03,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:03,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:03,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:24:03,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:03,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:09,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:09,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:24:09,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:24:09,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:24:09,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:09,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:24:09,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:09,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:24:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:09,295 INFO L273 TraceCheckSpWp]: Computing forward predicates...