java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:10:11,516 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:10:11,521 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:10:11,541 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:10:11,541 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:10:11,542 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:10:11,544 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:10:11,547 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:10:11,548 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:10:11,552 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:10:11,553 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:10:11,555 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:10:11,557 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:10:11,558 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:10:11,561 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:10:11,562 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:10:11,563 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:10:11,566 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:10:11,575 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:10:11,576 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:10:11,583 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:10:11,584 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:10:11,587 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:10:11,587 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:10:11,587 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:10:11,588 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:10:11,589 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:10:11,590 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:10:11,591 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:10:11,592 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:10:11,592 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:10:11,593 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:10:11,593 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:10:11,593 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:10:11,594 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:10:11,595 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:10:11,595 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-28 10:10:11,608 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:10:11,608 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:10:11,609 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:10:11,609 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:10:11,609 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:10:11,610 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:10:11,610 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:10:11,610 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:10:11,610 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 10:10:11,610 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:10:11,610 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 10:10:11,611 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 10:10:11,611 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:10:11,611 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:10:11,612 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:10:11,612 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:10:11,612 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:10:11,612 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:10:11,613 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:10:11,613 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:10:11,613 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:10:11,613 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:10:11,613 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:10:11,614 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:10:11,614 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:10:11,614 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:10:11,614 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:10:11,614 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:10:11,615 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:10:11,615 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:10:11,615 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:10:11,615 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:11,615 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:10:11,615 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:10:11,616 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:10:11,616 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:10:11,616 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:10:11,616 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:10:11,616 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:10:11,617 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:10:11,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:10:11,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:10:11,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:10:11,666 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:10:11,667 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:10:11,667 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-28 10:10:11,668 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2019-02-28 10:10:11,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:10:11,711 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:10:11,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:11,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:10:11,712 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:10:11,728 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 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,739 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 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:11,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:10:11,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:10:11,748 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:10:11,759 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 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,759 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 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,761 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 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,761 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 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,765 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 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,767 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 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,768 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 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:10:11,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:10:11,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:10:11,771 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:10:11,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:11,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:10:11,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:10:12,113 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:10:12,113 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-02-28 10:10:12,115 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:12 BoogieIcfgContainer [2019-02-28 10:10:12,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:10:12,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:10:12,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:10:12,119 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:10:12,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/2) ... [2019-02-28 10:10:12,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a385f2 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:10:12, skipping insertion in model container [2019-02-28 10:10:12,121 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 28.02 10:10:12" (2/2) ... [2019-02-28 10:10:12,123 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2019-02-28 10:10:12,132 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:10:12,140 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 10:10:12,157 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 10:10:12,189 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:10:12,190 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:10:12,190 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:10:12,190 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:10:12,190 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:10:12,190 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:10:12,191 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:10:12,191 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:10:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-28 10:10:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:10:12,211 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:12,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:10:12,215 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:12,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:12,221 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-28 10:10:12,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:12,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:12,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:12,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:10:12,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:10:12,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:12,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:10:12,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:10:12,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:10:12,417 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-28 10:10:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:12,521 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-02-28 10:10:12,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:10:12,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 10:10:12,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:12,533 INFO L225 Difference]: With dead ends: 10 [2019-02-28 10:10:12,534 INFO L226 Difference]: Without dead ends: 6 [2019-02-28 10:10:12,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:10:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-28 10:10:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-28 10:10:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 10:10:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-02-28 10:10:12,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-02-28 10:10:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:12,573 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-02-28 10:10:12,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:10:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-02-28 10:10:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:10:12,574 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:12,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:10:12,574 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:12,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:12,575 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2019-02-28 10:10:12,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:12,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:12,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:10:12,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:10:12,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:12,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:10:12,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:10:12,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:10:12,659 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-02-28 10:10:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:12,718 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-02-28 10:10:12,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:10:12,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 10:10:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:12,719 INFO L225 Difference]: With dead ends: 11 [2019-02-28 10:10:12,720 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 10:10:12,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:10:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 10:10:12,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 10:10:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 10:10:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-28 10:10:12,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-02-28 10:10:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:12,723 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-28 10:10:12,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:10:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-28 10:10:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:10:12,724 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:12,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:10:12,725 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:12,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:12,725 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-28 10:10:12,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:12,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:12,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:13,014 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-28 10:10:13,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:13,015 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:10:13,017 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-28 10:10:13,054 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:10:13,054 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:10:13,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:10:13,242 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 2 different actions 5 times. Never widened. Performed 274 root evaluator evaluations with a maximum evaluation depth of 4. Performed 274 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:10:13,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:13,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:10:13,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:13,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:13,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:13,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-28 10:10:13,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:13,791 INFO L442 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-28 10:10:13,791 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:13,833 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:13,834 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:10:13,886 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-28 10:10:13,887 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:13,980 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:13,981 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:14,008 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:14,057 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:14,058 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:10:14,181 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-28 10:10:14,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:14,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-28 10:10:14,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:14,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:10:14,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:10:14,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:10:14,203 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 10 states. [2019-02-28 10:10:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:14,604 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-02-28 10:10:14,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:10:14,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:10:14,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:14,609 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:10:14,609 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 10:10:14,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:10:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 10:10:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-28 10:10:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:10:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-02-28 10:10:14,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-02-28 10:10:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:14,614 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-02-28 10:10:14,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:10:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-02-28 10:10:14,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:10:14,615 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:14,615 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-28 10:10:14,615 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:14,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:14,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1949841836, now seen corresponding path program 2 times [2019-02-28 10:10:14,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:14,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:14,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:14,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:14,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:14,758 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-28 10:10:14,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:14,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:14,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:14,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:14,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:14,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:14,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:14,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:14,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 10:10:14,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:14,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:10:14,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:14,812 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-28 10:10:14,812 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:14,857 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-28 10:10:14,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:14,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-02-28 10:10:14,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:14,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:10:14,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:10:14,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:10:14,877 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-02-28 10:10:15,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:15,129 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-02-28 10:10:15,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:10:15,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-28 10:10:15,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:15,131 INFO L225 Difference]: With dead ends: 11 [2019-02-28 10:10:15,131 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 10:10:15,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:10:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 10:10:15,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-28 10:10:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 10:10:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-28 10:10:15,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-02-28 10:10:15,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:15,143 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-02-28 10:10:15,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:10:15,144 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-02-28 10:10:15,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:10:15,144 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:15,144 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-28 10:10:15,145 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:15,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:15,147 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 3 times [2019-02-28 10:10:15,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:15,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:15,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:15,402 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-28 10:10:15,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:15,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:15,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:15,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:15,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:15,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:15,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:15,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:15,436 WARN L254 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-28 10:10:15,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:15,510 INFO L442 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-28 10:10:15,511 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:15,526 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:15,527 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:10:15,616 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-28 10:10:15,616 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:15,668 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:15,669 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:15,673 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:15,696 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:15,697 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:10:15,753 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-28 10:10:15,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:15,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2019-02-28 10:10:15,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:15,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:10:15,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:10:15,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:10:15,786 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 11 states. [2019-02-28 10:10:16,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:16,406 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-02-28 10:10:16,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-28 10:10:16,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-28 10:10:16,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:16,407 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:10:16,407 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:10:16,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-02-28 10:10:16,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:10:16,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-28 10:10:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 10:10:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-02-28 10:10:16,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-02-28 10:10:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:16,414 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-02-28 10:10:16,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:10:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-02-28 10:10:16,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 10:10:16,415 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:16,415 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-02-28 10:10:16,415 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:16,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:16,416 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 4 times [2019-02-28 10:10:16,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:16,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:16,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:16,758 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-28 10:10:16,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:16,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:16,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:16,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:16,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:16,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:16,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:16,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:16,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-28 10:10:16,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:16,925 INFO L442 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-28 10:10:16,925 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:16,931 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:16,932 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:10:16,954 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-28 10:10:16,954 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:16,969 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:16,970 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:16,972 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:16,976 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:16,976 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:10:17,010 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-28 10:10:17,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:17,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2019-02-28 10:10:17,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:17,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-28 10:10:17,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-28 10:10:17,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:10:17,031 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 16 states. [2019-02-28 10:10:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:17,438 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-02-28 10:10:17,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-28 10:10:17,439 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2019-02-28 10:10:17,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:17,439 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:10:17,440 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 10:10:17,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:10:17,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 10:10:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-28 10:10:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 10:10:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-02-28 10:10:17,445 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-02-28 10:10:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:17,445 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-02-28 10:10:17,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-28 10:10:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-02-28 10:10:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-28 10:10:17,446 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:17,446 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2019-02-28 10:10:17,446 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:17,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash 375043724, now seen corresponding path program 5 times [2019-02-28 10:10:17,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:17,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:17,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:17,512 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-28 10:10:17,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:17,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:17,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:17,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:17,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:17,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:17,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:17,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:17,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:10:17,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:17,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:10:17,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:17,547 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-28 10:10:17,548 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:17,620 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-28 10:10:17,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:17,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-02-28 10:10:17,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:17,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:10:17,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:10:17,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:10:17,642 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2019-02-28 10:10:17,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:17,793 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-02-28 10:10:17,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:10:17,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-02-28 10:10:17,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:17,794 INFO L225 Difference]: With dead ends: 15 [2019-02-28 10:10:17,794 INFO L226 Difference]: Without dead ends: 13 [2019-02-28 10:10:17,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:10:17,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-28 10:10:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-28 10:10:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 10:10:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-02-28 10:10:17,799 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-02-28 10:10:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:17,800 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-02-28 10:10:17,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:10:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-02-28 10:10:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-28 10:10:17,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:17,800 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-02-28 10:10:17,800 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:17,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:17,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 6 times [2019-02-28 10:10:17,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:17,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:17,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:18,000 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-28 10:10:18,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:18,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:18,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:18,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:18,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:18,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:18,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:18,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:18,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:18,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:18,023 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-28 10:10:18,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:18,138 INFO L442 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-28 10:10:18,139 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:18,159 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:18,160 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:10:18,185 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-28 10:10:18,185 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:18,221 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:18,221 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:18,224 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:18,237 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:18,238 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:10:18,365 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-28 10:10:18,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:18,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2019-02-28 10:10:18,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:18,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-28 10:10:18,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-28 10:10:18,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:10:18,388 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 17 states. [2019-02-28 10:10:19,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:19,193 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-02-28 10:10:19,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-28 10:10:19,194 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2019-02-28 10:10:19,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:19,194 INFO L225 Difference]: With dead ends: 23 [2019-02-28 10:10:19,194 INFO L226 Difference]: Without dead ends: 15 [2019-02-28 10:10:19,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2019-02-28 10:10:19,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-28 10:10:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-28 10:10:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-28 10:10:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-02-28 10:10:19,200 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-02-28 10:10:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:19,200 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-02-28 10:10:19,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-28 10:10:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-02-28 10:10:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-28 10:10:19,201 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:19,201 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-02-28 10:10:19,202 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:19,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:19,202 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 7 times [2019-02-28 10:10:19,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:19,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:19,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:19,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:19,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:19,515 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-28 10:10:19,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:19,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:19,516 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:19,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:19,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:19,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:19,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:19,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:19,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-28 10:10:19,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:19,765 INFO L442 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-28 10:10:19,766 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:19,770 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:19,770 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:10:19,796 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-28 10:10:19,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:19,820 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:19,820 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:19,824 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:19,829 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:19,829 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:10:19,856 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-28 10:10:19,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:19,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2019-02-28 10:10:19,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:19,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-28 10:10:19,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-28 10:10:19,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:10:19,877 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 22 states. [2019-02-28 10:10:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:20,713 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-02-28 10:10:20,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-28 10:10:20,714 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2019-02-28 10:10:20,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:20,715 INFO L225 Difference]: With dead ends: 24 [2019-02-28 10:10:20,715 INFO L226 Difference]: Without dead ends: 16 [2019-02-28 10:10:20,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:10:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-28 10:10:20,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-02-28 10:10:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:10:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-02-28 10:10:20,721 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-02-28 10:10:20,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:20,722 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-02-28 10:10:20,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-28 10:10:20,722 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-02-28 10:10:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-28 10:10:20,723 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:20,723 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2019-02-28 10:10:20,723 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:20,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:20,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1662915732, now seen corresponding path program 8 times [2019-02-28 10:10:20,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:20,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:20,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:20,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:20,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:20,914 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-28 10:10:20,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:20,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:20,915 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:20,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:20,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:20,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:20,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:20,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:20,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-28 10:10:20,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:20,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:10:20,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:21,000 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-28 10:10:21,000 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:21,240 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-28 10:10:21,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:21,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2019-02-28 10:10:21,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:21,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:10:21,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:10:21,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:10:21,260 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2019-02-28 10:10:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:21,371 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-02-28 10:10:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-28 10:10:21,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-02-28 10:10:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:21,372 INFO L225 Difference]: With dead ends: 19 [2019-02-28 10:10:21,372 INFO L226 Difference]: Without dead ends: 17 [2019-02-28 10:10:21,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:10:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-28 10:10:21,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-28 10:10:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:10:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-02-28 10:10:21,379 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-02-28 10:10:21,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:21,379 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-02-28 10:10:21,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:10:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-02-28 10:10:21,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-28 10:10:21,380 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:21,380 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-02-28 10:10:21,380 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:21,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:21,381 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 9 times [2019-02-28 10:10:21,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:21,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:21,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:21,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:21,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:21,653 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-28 10:10:21,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:21,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:21,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:21,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:21,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:21,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:21,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:21,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:21,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:21,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:21,677 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-28 10:10:21,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:21,865 INFO L442 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-28 10:10:21,865 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:21,915 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:21,916 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:10:21,943 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-28 10:10:21,943 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:21,970 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:21,971 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:21,972 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:21,985 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:21,986 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:10:22,218 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-28 10:10:22,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:22,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2019-02-28 10:10:22,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:22,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-28 10:10:22,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-28 10:10:22,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:10:22,240 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 23 states. [2019-02-28 10:10:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:23,132 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-02-28 10:10:23,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-28 10:10:23,132 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2019-02-28 10:10:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:23,133 INFO L225 Difference]: With dead ends: 29 [2019-02-28 10:10:23,133 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:10:23,135 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-28 10:10:23,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:10:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-28 10:10:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-28 10:10:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-02-28 10:10:23,141 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-02-28 10:10:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:23,141 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-02-28 10:10:23,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-28 10:10:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-02-28 10:10:23,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-28 10:10:23,142 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:23,142 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-02-28 10:10:23,143 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:23,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:23,143 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 10 times [2019-02-28 10:10:23,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:23,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:23,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:23,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:23,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:23,414 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-28 10:10:23,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:23,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:23,415 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:23,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:23,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:23,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:23,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:23,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:23,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-28 10:10:23,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:23,725 INFO L442 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-28 10:10:23,725 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:23,730 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:23,730 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:10:23,762 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-28 10:10:23,762 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:23,783 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:23,784 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:23,792 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:23,800 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:23,801 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:10:23,974 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-28 10:10:23,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:23,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2019-02-28 10:10:23,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:23,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-28 10:10:23,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-28 10:10:23,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:10:23,994 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 28 states. [2019-02-28 10:10:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:24,788 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-02-28 10:10:24,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-28 10:10:24,788 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 18 [2019-02-28 10:10:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:24,789 INFO L225 Difference]: With dead ends: 30 [2019-02-28 10:10:24,789 INFO L226 Difference]: Without dead ends: 20 [2019-02-28 10:10:24,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:10:24,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-28 10:10:24,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-02-28 10:10:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-28 10:10:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-02-28 10:10:24,797 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2019-02-28 10:10:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:24,798 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-02-28 10:10:24,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-28 10:10:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-02-28 10:10:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-28 10:10:24,798 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:24,798 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2019-02-28 10:10:24,799 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:24,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1547184052, now seen corresponding path program 11 times [2019-02-28 10:10:24,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:24,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:24,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:24,991 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-28 10:10:24,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:24,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:24,992 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:24,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:24,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:24,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:25,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:25,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:25,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-28 10:10:25,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:25,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-28 10:10:25,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:25,066 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-28 10:10:25,067 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:25,211 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-28 10:10:25,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:25,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2019-02-28 10:10:25,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:25,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:10:25,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:10:25,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:10:25,231 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-02-28 10:10:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:25,598 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-02-28 10:10:25,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-28 10:10:25,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-02-28 10:10:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:25,600 INFO L225 Difference]: With dead ends: 23 [2019-02-28 10:10:25,600 INFO L226 Difference]: Without dead ends: 21 [2019-02-28 10:10:25,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:10:25,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-28 10:10:25,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-28 10:10:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-28 10:10:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-02-28 10:10:25,607 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-02-28 10:10:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:25,608 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-02-28 10:10:25,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:10:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-02-28 10:10:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-28 10:10:25,608 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:25,609 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-02-28 10:10:25,609 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:25,609 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 12 times [2019-02-28 10:10:25,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:25,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:25,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:25,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:25,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:26,105 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-28 10:10:26,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:26,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:26,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:26,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:26,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:26,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:26,115 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:26,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:26,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:26,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:26,129 WARN L254 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-28 10:10:26,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:26,337 INFO L442 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-28 10:10:26,338 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:26,343 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:26,343 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:10:26,374 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-28 10:10:26,374 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:26,452 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:26,452 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:26,454 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:26,464 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:26,465 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:10:26,766 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-28 10:10:26,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:26,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 38 [2019-02-28 10:10:26,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:26,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-28 10:10:26,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-28 10:10:26,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:10:26,787 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 29 states. [2019-02-28 10:10:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:28,035 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-02-28 10:10:28,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-28 10:10:28,035 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-02-28 10:10:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:28,036 INFO L225 Difference]: With dead ends: 35 [2019-02-28 10:10:28,036 INFO L226 Difference]: Without dead ends: 23 [2019-02-28 10:10:28,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=403, Invalid=2147, Unknown=0, NotChecked=0, Total=2550 [2019-02-28 10:10:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-28 10:10:28,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-28 10:10:28,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-28 10:10:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-02-28 10:10:28,045 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-02-28 10:10:28,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:28,046 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-02-28 10:10:28,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-28 10:10:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-02-28 10:10:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-28 10:10:28,046 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:28,047 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-02-28 10:10:28,047 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:28,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:28,047 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 13 times [2019-02-28 10:10:28,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:28,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:28,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:28,465 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-28 10:10:28,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:28,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:28,466 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:28,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:28,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:28,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:28,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:28,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:28,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-28 10:10:28,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:28,816 INFO L442 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-28 10:10:28,817 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:28,825 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:28,825 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:10:28,885 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-28 10:10:28,885 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:28,889 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:28,889 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:28,890 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:28,892 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:28,893 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:10:29,263 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-28 10:10:29,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:29,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2019-02-28 10:10:29,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:29,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-28 10:10:29,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-28 10:10:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:10:29,290 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 34 states. [2019-02-28 10:10:30,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:30,106 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-02-28 10:10:30,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-28 10:10:30,106 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2019-02-28 10:10:30,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:30,107 INFO L225 Difference]: With dead ends: 36 [2019-02-28 10:10:30,107 INFO L226 Difference]: Without dead ends: 24 [2019-02-28 10:10:30,108 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-28 10:10:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-28 10:10:30,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-02-28 10:10:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-28 10:10:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-02-28 10:10:30,116 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-02-28 10:10:30,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:30,116 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-02-28 10:10:30,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-28 10:10:30,116 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-02-28 10:10:30,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-28 10:10:30,116 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:30,117 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2019-02-28 10:10:30,117 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:30,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:30,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1283882284, now seen corresponding path program 14 times [2019-02-28 10:10:30,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:30,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:30,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:30,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:30,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:30,900 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-28 10:10:30,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:30,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:30,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:30,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:30,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:30,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:30,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:30,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:30,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-28 10:10:30,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:30,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-28 10:10:30,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:30,947 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-28 10:10:30,947 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:31,062 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-28 10:10:31,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:31,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2019-02-28 10:10:31,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:31,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:10:31,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:10:31,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:10:31,082 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 13 states. [2019-02-28 10:10:31,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:31,214 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-02-28 10:10:31,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-28 10:10:31,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-02-28 10:10:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:31,215 INFO L225 Difference]: With dead ends: 27 [2019-02-28 10:10:31,216 INFO L226 Difference]: Without dead ends: 25 [2019-02-28 10:10:31,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 20 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:10:31,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-28 10:10:31,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-28 10:10:31,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-28 10:10:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-02-28 10:10:31,227 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2019-02-28 10:10:31,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:31,227 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-02-28 10:10:31,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:10:31,227 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-02-28 10:10:31,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-28 10:10:31,228 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:31,228 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-02-28 10:10:31,228 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:31,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:31,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 15 times [2019-02-28 10:10:31,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:31,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:31,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:31,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:31,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:31,700 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-28 10:10:31,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:31,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:31,700 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:31,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:31,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:31,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:31,709 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:31,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:31,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:31,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:31,730 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-28 10:10:31,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:32,064 INFO L442 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-28 10:10:32,065 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:32,073 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:32,074 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:10:32,113 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-28 10:10:32,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:32,144 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:32,145 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:32,146 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:32,156 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:32,156 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:10:32,521 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-28 10:10:32,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:32,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 46 [2019-02-28 10:10:32,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:32,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-28 10:10:32,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-28 10:10:32,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:10:32,542 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2019-02-28 10:10:34,338 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-02-28 10:10:34,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:34,341 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-02-28 10:10:34,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-28 10:10:34,342 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2019-02-28 10:10:34,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:34,342 INFO L225 Difference]: With dead ends: 41 [2019-02-28 10:10:34,342 INFO L226 Difference]: Without dead ends: 27 [2019-02-28 10:10:34,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=553, Invalid=3107, Unknown=0, NotChecked=0, Total=3660 [2019-02-28 10:10:34,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-28 10:10:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-28 10:10:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-28 10:10:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-02-28 10:10:34,354 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-02-28 10:10:34,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:34,354 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-02-28 10:10:34,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-28 10:10:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-02-28 10:10:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-28 10:10:34,355 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:34,359 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-02-28 10:10:34,359 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:34,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:34,359 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 16 times [2019-02-28 10:10:34,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:34,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:34,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:34,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:34,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:34,843 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-28 10:10:34,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:34,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:34,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:34,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:34,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:34,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:34,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:34,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:34,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-28 10:10:34,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:35,372 INFO L442 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-28 10:10:35,372 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:35,376 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:35,376 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:10:35,415 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-28 10:10:35,415 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:35,440 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:35,440 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:35,441 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:35,444 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:35,444 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:10:35,535 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-28 10:10:35,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:35,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2019-02-28 10:10:35,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:35,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-28 10:10:35,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-28 10:10:35,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:10:35,556 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 40 states. [2019-02-28 10:10:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:36,728 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-02-28 10:10:36,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-28 10:10:36,729 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2019-02-28 10:10:36,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:36,730 INFO L225 Difference]: With dead ends: 42 [2019-02-28 10:10:36,730 INFO L226 Difference]: Without dead ends: 28 [2019-02-28 10:10:36,731 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-28 10:10:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-28 10:10:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-02-28 10:10:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-28 10:10:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-02-28 10:10:36,740 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-02-28 10:10:36,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:36,741 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-02-28 10:10:36,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-28 10:10:36,741 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-02-28 10:10:36,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-28 10:10:36,741 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:36,742 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2019-02-28 10:10:36,742 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:36,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash -568862196, now seen corresponding path program 17 times [2019-02-28 10:10:36,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:36,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:36,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:36,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:36,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:36,920 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-28 10:10:36,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:36,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:36,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:36,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:36,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:36,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:36,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:36,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:36,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-28 10:10:36,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:36,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-28 10:10:36,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:36,977 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-28 10:10:36,978 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:37,271 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-28 10:10:37,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:37,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2019-02-28 10:10:37,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:37,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-28 10:10:37,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-28 10:10:37,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:10:37,292 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 15 states. [2019-02-28 10:10:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:37,515 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-02-28 10:10:37,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-28 10:10:37,515 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-02-28 10:10:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:37,516 INFO L225 Difference]: With dead ends: 31 [2019-02-28 10:10:37,516 INFO L226 Difference]: Without dead ends: 29 [2019-02-28 10:10:37,517 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-28 10:10:37,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-28 10:10:37,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-28 10:10:37,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-28 10:10:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-02-28 10:10:37,528 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2019-02-28 10:10:37,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:37,528 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-02-28 10:10:37,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-28 10:10:37,528 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-02-28 10:10:37,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-28 10:10:37,529 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:37,529 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-02-28 10:10:37,529 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:37,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:37,529 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 18 times [2019-02-28 10:10:37,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:37,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:37,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:37,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:37,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:38,008 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-28 10:10:38,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:38,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:38,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:38,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:38,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:38,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:38,017 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:38,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:38,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:38,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:38,037 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-28 10:10:38,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:38,615 INFO L442 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-28 10:10:38,616 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:38,620 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:38,621 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:10:38,663 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-28 10:10:38,663 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:38,700 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:38,701 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:38,702 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:38,712 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:38,712 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:10:39,194 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-28 10:10:39,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:39,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 15] total 54 [2019-02-28 10:10:39,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:39,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-28 10:10:39,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-28 10:10:39,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2444, Unknown=0, NotChecked=0, Total=2862 [2019-02-28 10:10:39,214 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2019-02-28 10:10:40,421 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-02-28 10:10:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:41,547 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-02-28 10:10:41,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-28 10:10:41,547 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 28 [2019-02-28 10:10:41,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:41,548 INFO L225 Difference]: With dead ends: 47 [2019-02-28 10:10:41,548 INFO L226 Difference]: Without dead ends: 31 [2019-02-28 10:10:41,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=727, Invalid=4243, Unknown=0, NotChecked=0, Total=4970 [2019-02-28 10:10:41,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-28 10:10:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-28 10:10:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-28 10:10:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-02-28 10:10:41,563 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-02-28 10:10:41,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:41,563 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-02-28 10:10:41,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-28 10:10:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-02-28 10:10:41,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-28 10:10:41,564 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:41,564 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-02-28 10:10:41,565 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:41,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:41,565 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 19 times [2019-02-28 10:10:41,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:41,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:41,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:41,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:41,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:42,659 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-28 10:10:42,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:42,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:42,659 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:42,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:42,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:42,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:42,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:42,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:42,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 66 conjunts are in the unsatisfiable core [2019-02-28 10:10:42,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:43,589 INFO L442 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-28 10:10:43,589 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:43,592 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:43,593 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:10:43,633 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-28 10:10:43,633 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:43,636 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:43,636 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:43,637 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:43,640 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:43,640 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:10:43,768 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-28 10:10:43,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:43,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2019-02-28 10:10:43,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:43,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-28 10:10:43,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-28 10:10:43,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:10:43,790 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 46 states. [2019-02-28 10:10:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:45,267 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-02-28 10:10:45,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-28 10:10:45,267 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2019-02-28 10:10:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:45,268 INFO L225 Difference]: With dead ends: 48 [2019-02-28 10:10:45,268 INFO L226 Difference]: Without dead ends: 32 [2019-02-28 10:10:45,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:10:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-28 10:10:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-02-28 10:10:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-28 10:10:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-02-28 10:10:45,281 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2019-02-28 10:10:45,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:45,281 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-02-28 10:10:45,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-28 10:10:45,281 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-02-28 10:10:45,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-28 10:10:45,286 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:45,286 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1] [2019-02-28 10:10:45,286 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:45,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:45,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1693839084, now seen corresponding path program 20 times [2019-02-28 10:10:45,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:45,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:45,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:45,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:45,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:45,512 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-28 10:10:45,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:45,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:45,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:45,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:45,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:45,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:45,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:45,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:45,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-28 10:10:45,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:45,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-28 10:10:45,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:45,595 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-28 10:10:45,595 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:45,781 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-28 10:10:45,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:45,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2019-02-28 10:10:45,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:45,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-28 10:10:45,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-28 10:10:45,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:10:45,802 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2019-02-28 10:10:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:46,016 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-02-28 10:10:46,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-28 10:10:46,017 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-02-28 10:10:46,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:46,018 INFO L225 Difference]: With dead ends: 35 [2019-02-28 10:10:46,018 INFO L226 Difference]: Without dead ends: 33 [2019-02-28 10:10:46,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-02-28 10:10:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-28 10:10:46,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-28 10:10:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-28 10:10:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-02-28 10:10:46,033 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2019-02-28 10:10:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:46,033 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-02-28 10:10:46,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-28 10:10:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-02-28 10:10:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-28 10:10:46,034 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:46,034 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-02-28 10:10:46,034 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:46,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:46,035 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 21 times [2019-02-28 10:10:46,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:46,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:46,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:46,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:46,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:46,815 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-28 10:10:46,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:46,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:46,816 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:46,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:46,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:46,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:46,825 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:46,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:46,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:46,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:46,845 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-28 10:10:46,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:47,390 INFO L442 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-28 10:10:47,390 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:47,394 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:47,395 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:10:47,439 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-28 10:10:47,439 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:47,482 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:47,482 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:47,484 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:47,493 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:47,494 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:10:48,111 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-28 10:10:48,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:48,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17, 17] total 62 [2019-02-28 10:10:48,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:48,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:10:48,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:10:48,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=3240, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:10:48,132 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 47 states. [2019-02-28 10:10:50,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:50,162 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-02-28 10:10:50,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-28 10:10:50,165 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 32 [2019-02-28 10:10:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:50,166 INFO L225 Difference]: With dead ends: 53 [2019-02-28 10:10:50,166 INFO L226 Difference]: Without dead ends: 35 [2019-02-28 10:10:50,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=925, Invalid=5555, Unknown=0, NotChecked=0, Total=6480 [2019-02-28 10:10:50,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-28 10:10:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-28 10:10:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-28 10:10:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-02-28 10:10:50,181 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-02-28 10:10:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:50,181 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-02-28 10:10:50,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:10:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-02-28 10:10:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-28 10:10:50,182 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:50,182 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-02-28 10:10:50,182 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:50,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:50,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 22 times [2019-02-28 10:10:50,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:50,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:50,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:50,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:50,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:51,128 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-28 10:10:51,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:51,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:51,128 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:51,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:51,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:51,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:51,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:51,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:51,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-28 10:10:51,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:51,843 INFO L442 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-28 10:10:51,844 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:51,847 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:51,848 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:10:51,894 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-28 10:10:51,895 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:51,898 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:51,898 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:51,899 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:51,901 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:51,901 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:10:52,075 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-28 10:10:52,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:52,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2019-02-28 10:10:52,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:52,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-28 10:10:52,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-28 10:10:52,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2501, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:10:52,095 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 52 states. [2019-02-28 10:10:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:53,828 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-02-28 10:10:53,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-28 10:10:53,828 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 34 [2019-02-28 10:10:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:53,829 INFO L225 Difference]: With dead ends: 54 [2019-02-28 10:10:53,829 INFO L226 Difference]: Without dead ends: 36 [2019-02-28 10:10:53,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=320, Invalid=4510, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:10:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-28 10:10:53,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-02-28 10:10:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-28 10:10:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-02-28 10:10:53,844 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2019-02-28 10:10:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:53,844 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-02-28 10:10:53,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-28 10:10:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-02-28 10:10:53,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-28 10:10:53,845 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:53,845 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1] [2019-02-28 10:10:53,845 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:53,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:53,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1394260940, now seen corresponding path program 23 times [2019-02-28 10:10:53,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:53,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:53,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:53,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:53,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:54,452 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-28 10:10:54,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:54,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:54,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:54,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:54,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:54,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:54,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:54,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:54,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-28 10:10:54,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:54,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-28 10:10:54,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:54,523 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-28 10:10:54,523 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:54,956 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-28 10:10:54,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:54,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2019-02-28 10:10:54,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:54,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-28 10:10:54,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-28 10:10:54,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:10:54,975 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2019-02-28 10:10:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:55,210 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-02-28 10:10:55,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-28 10:10:55,210 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-02-28 10:10:55,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:55,210 INFO L225 Difference]: With dead ends: 39 [2019-02-28 10:10:55,210 INFO L226 Difference]: Without dead ends: 37 [2019-02-28 10:10:55,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 32 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-02-28 10:10:55,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-28 10:10:55,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-28 10:10:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-28 10:10:55,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-02-28 10:10:55,228 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-02-28 10:10:55,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:55,228 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-02-28 10:10:55,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-28 10:10:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-02-28 10:10:55,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-28 10:10:55,229 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:55,229 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-02-28 10:10:55,229 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:55,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:55,229 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 24 times [2019-02-28 10:10:55,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:55,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:55,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:55,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:55,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:56,074 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-28 10:10:56,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:56,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:56,075 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:56,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:56,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:56,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:56,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:56,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:56,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:56,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:56,115 WARN L254 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 78 conjunts are in the unsatisfiable core [2019-02-28 10:10:56,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:56,821 INFO L442 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-28 10:10:56,822 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:56,828 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:56,828 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:10:56,879 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-28 10:10:56,879 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:56,928 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:10:56,929 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:56,932 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:56,942 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:56,942 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:10:57,755 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-28 10:10:57,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:57,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19, 19] total 70 [2019-02-28 10:10:57,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:57,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-28 10:10:57,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-28 10:10:57,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=4148, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:10:57,775 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 53 states. [2019-02-28 10:11:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:00,388 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-02-28 10:11:00,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-28 10:11:00,388 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 36 [2019-02-28 10:11:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:00,389 INFO L225 Difference]: With dead ends: 59 [2019-02-28 10:11:00,389 INFO L226 Difference]: Without dead ends: 39 [2019-02-28 10:11:00,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1147, Invalid=7043, Unknown=0, NotChecked=0, Total=8190 [2019-02-28 10:11:00,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-28 10:11:00,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-28 10:11:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-28 10:11:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-02-28 10:11:00,407 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-02-28 10:11:00,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:00,407 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-02-28 10:11:00,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-28 10:11:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-02-28 10:11:00,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-28 10:11:00,408 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:00,408 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-02-28 10:11:00,408 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:00,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:00,409 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 25 times [2019-02-28 10:11:00,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:00,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:00,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:00,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:00,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:01,447 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-28 10:11:01,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:01,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:01,447 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:01,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:01,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:01,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:01,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:01,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:01,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-28 10:11:01,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:02,326 INFO L442 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-28 10:11:02,326 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:02,330 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:02,331 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:11:02,383 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-28 10:11:02,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:02,385 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:11:02,386 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:02,387 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:02,389 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:02,389 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:11:02,630 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-28 10:11:02,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:02,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2019-02-28 10:11:02,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:02,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-28 10:11:02,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-28 10:11:02,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:11:02,650 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 58 states. [2019-02-28 10:11:04,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:04,718 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-02-28 10:11:04,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-28 10:11:04,718 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 38 [2019-02-28 10:11:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:04,719 INFO L225 Difference]: With dead ends: 60 [2019-02-28 10:11:04,719 INFO L226 Difference]: Without dead ends: 40 [2019-02-28 10:11:04,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:11:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-28 10:11:04,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-02-28 10:11:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-28 10:11:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-02-28 10:11:04,735 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-02-28 10:11:04,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:04,735 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-02-28 10:11:04,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-28 10:11:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-02-28 10:11:04,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-28 10:11:04,736 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:04,736 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1] [2019-02-28 10:11:04,736 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:04,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:04,736 INFO L82 PathProgramCache]: Analyzing trace with hash 536887468, now seen corresponding path program 26 times [2019-02-28 10:11:04,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:04,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:04,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:05,281 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-28 10:11:05,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:05,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:05,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:05,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:05,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:05,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:05,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:05,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:05,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-28 10:11:05,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:05,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-28 10:11:05,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:05,361 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-28 10:11:05,361 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:05,629 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-28 10:11:05,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:05,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2019-02-28 10:11:05,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:05,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-28 10:11:05,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-28 10:11:05,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-02-28 10:11:05,649 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 21 states. [2019-02-28 10:11:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:05,941 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-02-28 10:11:05,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-28 10:11:05,941 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-02-28 10:11:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:05,942 INFO L225 Difference]: With dead ends: 43 [2019-02-28 10:11:05,942 INFO L226 Difference]: Without dead ends: 41 [2019-02-28 10:11:05,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 36 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-02-28 10:11:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-28 10:11:05,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-28 10:11:05,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:11:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-02-28 10:11:05,960 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2019-02-28 10:11:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:05,961 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-02-28 10:11:05,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-28 10:11:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-02-28 10:11:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-28 10:11:05,961 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:05,961 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-02-28 10:11:05,961 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:05,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:05,962 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 27 times [2019-02-28 10:11:05,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:05,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:05,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:05,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:05,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:07,029 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-28 10:11:07,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:07,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:07,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:07,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:07,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:07,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:07,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:07,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:07,066 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:07,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:07,068 WARN L254 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 86 conjunts are in the unsatisfiable core [2019-02-28 10:11:07,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:07,879 INFO L442 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-28 10:11:07,879 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:07,883 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:07,883 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:11:07,938 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-28 10:11:07,938 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:07,989 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:11:07,989 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:07,991 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:08,002 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:08,002 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:11:09,072 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-28 10:11:09,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:09,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 21, 21] total 78 [2019-02-28 10:11:09,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:09,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-28 10:11:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-28 10:11:09,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=5168, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:11:09,099 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 59 states. [2019-02-28 10:11:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:11,888 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-02-28 10:11:11,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-28 10:11:11,889 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 40 [2019-02-28 10:11:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:11,889 INFO L225 Difference]: With dead ends: 65 [2019-02-28 10:11:11,890 INFO L226 Difference]: Without dead ends: 43 [2019-02-28 10:11:11,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1393, Invalid=8707, Unknown=0, NotChecked=0, Total=10100 [2019-02-28 10:11:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-28 10:11:11,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-28 10:11:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-28 10:11:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-02-28 10:11:11,914 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-02-28 10:11:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:11,914 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-02-28 10:11:11,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-28 10:11:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-02-28 10:11:11,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-28 10:11:11,915 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:11,915 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-02-28 10:11:11,915 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:11,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:11,916 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 28 times [2019-02-28 10:11:11,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:11,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:11,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:11,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:11,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:12,868 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-28 10:11:12,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:12,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:12,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:12,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:12,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:12,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:12,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:12,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:12,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 90 conjunts are in the unsatisfiable core [2019-02-28 10:11:12,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:13,901 INFO L442 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-28 10:11:13,902 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:13,906 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:13,906 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:11:13,963 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-28 10:11:13,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:13,966 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:11:13,966 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:13,969 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:13,971 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:13,971 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:11:14,298 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-28 10:11:14,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:14,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2019-02-28 10:11:14,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:14,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-28 10:11:14,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-28 10:11:14,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3845, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:11:14,325 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 64 states. [2019-02-28 10:11:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:16,865 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-02-28 10:11:16,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-28 10:11:16,866 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 42 [2019-02-28 10:11:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:16,866 INFO L225 Difference]: With dead ends: 66 [2019-02-28 10:11:16,866 INFO L226 Difference]: Without dead ends: 44 [2019-02-28 10:11:16,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 47 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=396, Invalid=6914, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:11:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-28 10:11:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-02-28 10:11:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-28 10:11:16,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-02-28 10:11:16,890 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2019-02-28 10:11:16,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:16,890 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-02-28 10:11:16,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-28 10:11:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-02-28 10:11:16,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-28 10:11:16,891 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:16,891 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1] [2019-02-28 10:11:16,891 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:16,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:16,892 INFO L82 PathProgramCache]: Analyzing trace with hash -392135284, now seen corresponding path program 29 times [2019-02-28 10:11:16,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:16,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:16,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:16,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:16,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:17,252 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-28 10:11:17,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:17,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:17,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:17,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:17,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:17,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:17,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:17,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:17,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-28 10:11:17,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:17,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-28 10:11:17,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:17,349 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-28 10:11:17,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:17,747 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-28 10:11:17,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:17,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2019-02-28 10:11:17,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:17,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-28 10:11:17,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-28 10:11:17,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:11:17,767 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 23 states. [2019-02-28 10:11:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:18,060 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-02-28 10:11:18,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-28 10:11:18,061 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-02-28 10:11:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:18,061 INFO L225 Difference]: With dead ends: 47 [2019-02-28 10:11:18,061 INFO L226 Difference]: Without dead ends: 45 [2019-02-28 10:11:18,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 40 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-02-28 10:11:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-28 10:11:18,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-28 10:11:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-28 10:11:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-02-28 10:11:18,077 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2019-02-28 10:11:18,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:18,078 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-02-28 10:11:18,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-28 10:11:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-02-28 10:11:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-28 10:11:18,078 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:18,078 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-02-28 10:11:18,078 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:18,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:18,079 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 30 times [2019-02-28 10:11:18,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:18,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:18,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:18,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:18,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:19,144 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-28 10:11:19,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:19,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:19,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:19,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:19,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:19,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:19,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:19,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:19,179 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:19,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:19,181 WARN L254 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-28 10:11:19,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:20,356 INFO L442 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-28 10:11:20,356 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:20,366 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:20,366 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:11:20,501 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-28 10:11:20,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:20,556 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:11:20,556 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:20,557 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:20,568 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:20,568 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:11:21,726 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-28 10:11:21,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:21,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23, 23] total 86 [2019-02-28 10:11:21,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:21,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-28 10:11:21,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-28 10:11:21,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1010, Invalid=6300, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:11:21,746 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 65 states. [2019-02-28 10:11:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:25,104 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-02-28 10:11:25,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-28 10:11:25,105 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 44 [2019-02-28 10:11:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:25,106 INFO L225 Difference]: With dead ends: 71 [2019-02-28 10:11:25,106 INFO L226 Difference]: Without dead ends: 47 [2019-02-28 10:11:25,107 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-28 10:11:25,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-28 10:11:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-28 10:11:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-28 10:11:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-02-28 10:11:25,125 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-02-28 10:11:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:25,125 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-02-28 10:11:25,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-28 10:11:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-02-28 10:11:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-28 10:11:25,126 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:25,126 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-02-28 10:11:25,126 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:25,126 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 31 times [2019-02-28 10:11:25,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:25,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:25,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:25,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:25,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:26,294 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-28 10:11:26,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:26,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:26,294 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:26,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:26,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:26,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:26,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:26,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:26,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 98 conjunts are in the unsatisfiable core [2019-02-28 10:11:26,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:27,580 INFO L442 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-28 10:11:27,581 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:27,587 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:27,588 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:11:27,650 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-28 10:11:27,650 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:27,655 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:11:27,655 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:27,657 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:27,659 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:27,659 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:11:28,064 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-28 10:11:28,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:28,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2019-02-28 10:11:28,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:28,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-28 10:11:28,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-28 10:11:28,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:11:28,085 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 70 states. [2019-02-28 10:11:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:31,257 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-02-28 10:11:31,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-28 10:11:31,258 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 46 [2019-02-28 10:11:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:31,258 INFO L225 Difference]: With dead ends: 72 [2019-02-28 10:11:31,258 INFO L226 Difference]: Without dead ends: 48 [2019-02-28 10:11:31,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 51 SyntacticMatches, 16 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:11:31,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-28 10:11:31,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-02-28 10:11:31,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-28 10:11:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-02-28 10:11:31,277 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2019-02-28 10:11:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:31,277 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-02-28 10:11:31,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-28 10:11:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-02-28 10:11:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-28 10:11:31,278 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:31,278 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1] [2019-02-28 10:11:31,278 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:31,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:31,278 INFO L82 PathProgramCache]: Analyzing trace with hash 259355244, now seen corresponding path program 32 times [2019-02-28 10:11:31,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:31,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:31,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:31,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:31,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:31,658 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-28 10:11:31,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:31,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:31,659 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:31,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:31,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:31,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:31,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:31,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:31,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-28 10:11:31,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:31,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-28 10:11:31,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:31,763 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-28 10:11:31,764 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:32,167 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-28 10:11:32,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:32,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2019-02-28 10:11:32,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:32,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-28 10:11:32,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-28 10:11:32,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-02-28 10:11:32,187 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 25 states. [2019-02-28 10:11:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:32,562 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-02-28 10:11:32,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-28 10:11:32,562 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-02-28 10:11:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:32,563 INFO L225 Difference]: With dead ends: 51 [2019-02-28 10:11:32,563 INFO L226 Difference]: Without dead ends: 49 [2019-02-28 10:11:32,564 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-28 10:11:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-28 10:11:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-28 10:11:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-28 10:11:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-02-28 10:11:32,583 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2019-02-28 10:11:32,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:32,583 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-02-28 10:11:32,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-28 10:11:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-02-28 10:11:32,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-28 10:11:32,584 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:32,584 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-02-28 10:11:32,584 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:32,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:32,585 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 33 times [2019-02-28 10:11:32,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:32,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:32,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:32,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:32,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:33,904 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-28 10:11:33,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:33,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:33,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:33,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:33,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:33,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:33,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:33,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:33,959 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:33,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:33,961 WARN L254 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 102 conjunts are in the unsatisfiable core [2019-02-28 10:11:33,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:35,210 INFO L442 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-28 10:11:35,210 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:35,219 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:35,219 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:11:35,289 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-28 10:11:35,289 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:35,357 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:11:35,358 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:35,360 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:35,369 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:35,370 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:11:36,940 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-28 10:11:36,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:36,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 25, 25] total 94 [2019-02-28 10:11:36,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:36,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-28 10:11:36,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-28 10:11:36,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1198, Invalid=7544, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:11:36,960 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 71 states. [2019-02-28 10:11:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:40,739 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-02-28 10:11:40,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-28 10:11:40,740 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 48 [2019-02-28 10:11:40,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:40,740 INFO L225 Difference]: With dead ends: 77 [2019-02-28 10:11:40,740 INFO L226 Difference]: Without dead ends: 51 [2019-02-28 10:11:40,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1957, Invalid=12563, Unknown=0, NotChecked=0, Total=14520 [2019-02-28 10:11:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-28 10:11:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-28 10:11:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-28 10:11:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-02-28 10:11:40,763 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-02-28 10:11:40,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:40,763 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-02-28 10:11:40,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-28 10:11:40,763 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-02-28 10:11:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-28 10:11:40,763 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:40,763 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-02-28 10:11:40,763 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:40,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 34 times [2019-02-28 10:11:40,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:40,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:40,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:40,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:42,337 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-28 10:11:42,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:42,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:42,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:42,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:42,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:42,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:42,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:42,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:42,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-28 10:11:42,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:43,768 INFO L442 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-28 10:11:43,768 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:43,774 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:43,774 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:11:43,842 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-28 10:11:43,843 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:43,845 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:11:43,845 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:43,846 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:43,849 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:43,849 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:11:44,495 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-28 10:11:44,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:44,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 75 [2019-02-28 10:11:44,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:44,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-28 10:11:44,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-28 10:11:44,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5477, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:11:44,515 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 76 states. [2019-02-28 10:11:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:47,752 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-02-28 10:11:47,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-28 10:11:47,752 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 50 [2019-02-28 10:11:47,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:47,753 INFO L225 Difference]: With dead ends: 78 [2019-02-28 10:11:47,753 INFO L226 Difference]: Without dead ends: 52 [2019-02-28 10:11:47,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 55 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=472, Invalid=9830, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:11:47,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-28 10:11:47,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-02-28 10:11:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-28 10:11:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-02-28 10:11:47,775 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-02-28 10:11:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:47,775 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-02-28 10:11:47,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-28 10:11:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-02-28 10:11:47,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-28 10:11:47,775 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:47,776 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1] [2019-02-28 10:11:47,776 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:47,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:47,776 INFO L82 PathProgramCache]: Analyzing trace with hash -596041908, now seen corresponding path program 35 times [2019-02-28 10:11:47,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:47,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:47,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:47,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:47,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:48,155 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-28 10:11:48,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:48,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:48,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:48,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:48,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:48,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:48,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:48,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:48,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-28 10:11:48,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:48,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-28 10:11:48,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:48,278 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-28 10:11:48,278 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:48,758 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-28 10:11:48,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:48,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2019-02-28 10:11:48,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:48,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-28 10:11:48,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-28 10:11:48,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-02-28 10:11:48,778 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 27 states. [2019-02-28 10:11:49,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:49,158 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-02-28 10:11:49,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-28 10:11:49,159 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-02-28 10:11:49,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:49,159 INFO L225 Difference]: With dead ends: 55 [2019-02-28 10:11:49,159 INFO L226 Difference]: Without dead ends: 53 [2019-02-28 10:11:49,160 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-28 10:11:49,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-28 10:11:49,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-28 10:11:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-28 10:11:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-02-28 10:11:49,181 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 51 [2019-02-28 10:11:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:49,181 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-02-28 10:11:49,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-28 10:11:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-02-28 10:11:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-28 10:11:49,182 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:49,182 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-02-28 10:11:49,182 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:49,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:49,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 36 times [2019-02-28 10:11:49,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:49,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:49,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:49,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:49,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:50,547 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-28 10:11:50,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:50,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:50,548 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:50,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:50,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:50,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:50,556 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:50,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:50,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:50,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:50,589 WARN L254 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 110 conjunts are in the unsatisfiable core [2019-02-28 10:11:50,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:52,676 INFO L442 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-28 10:11:52,677 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:52,681 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:52,681 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:11:52,767 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-28 10:11:52,767 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:52,831 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:11:52,831 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:52,832 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:52,841 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:52,841 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:11:54,523 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-28 10:11:54,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:54,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 27, 27] total 102 [2019-02-28 10:11:54,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:54,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-28 10:11:54,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-28 10:11:54,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1402, Invalid=8900, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:11:54,544 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 77 states. [2019-02-28 10:11:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:58,774 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-02-28 10:11:58,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-28 10:11:58,774 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 52 [2019-02-28 10:11:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:58,775 INFO L225 Difference]: With dead ends: 83 [2019-02-28 10:11:58,775 INFO L226 Difference]: Without dead ends: 55 [2019-02-28 10:11:58,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2275, Invalid=14755, Unknown=0, NotChecked=0, Total=17030 [2019-02-28 10:11:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-28 10:11:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-28 10:11:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-28 10:11:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-02-28 10:11:58,804 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-02-28 10:11:58,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:58,804 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-02-28 10:11:58,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-28 10:11:58,805 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-02-28 10:11:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-28 10:11:58,805 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:58,805 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-02-28 10:11:58,805 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:58,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:58,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 37 times [2019-02-28 10:11:58,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:58,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:58,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:58,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:58,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:00,274 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-28 10:12:00,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:00,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:00,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:00,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:00,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:00,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:00,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:00,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:00,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 114 conjunts are in the unsatisfiable core [2019-02-28 10:12:00,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:02,253 INFO L442 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-28 10:12:02,254 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:02,259 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:02,259 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:12:02,335 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-28 10:12:02,335 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:02,337 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:12:02,338 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:02,339 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:02,341 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:02,341 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:12:02,960 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-28 10:12:02,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:02,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 81 [2019-02-28 10:12:02,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:02,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-28 10:12:02,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-28 10:12:02,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:12:02,980 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 82 states. [2019-02-28 10:12:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:06,875 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-02-28 10:12:06,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-28 10:12:06,876 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 54 [2019-02-28 10:12:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:06,876 INFO L225 Difference]: With dead ends: 84 [2019-02-28 10:12:06,877 INFO L226 Difference]: Without dead ends: 56 [2019-02-28 10:12:06,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 59 SyntacticMatches, 20 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:12:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-28 10:12:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-02-28 10:12:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-28 10:12:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-02-28 10:12:06,900 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2019-02-28 10:12:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:06,901 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-02-28 10:12:06,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-28 10:12:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-02-28 10:12:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-28 10:12:06,901 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:06,901 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1] [2019-02-28 10:12:06,902 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:06,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:06,902 INFO L82 PathProgramCache]: Analyzing trace with hash 488997932, now seen corresponding path program 38 times [2019-02-28 10:12:06,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:06,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:06,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:06,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:07,427 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-28 10:12:07,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:07,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:07,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:07,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:07,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:07,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:07,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:07,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:07,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-28 10:12:07,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:07,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-28 10:12:07,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:07,565 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-28 10:12:07,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:08,167 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-28 10:12:08,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:08,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2019-02-28 10:12:08,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:08,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-28 10:12:08,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-28 10:12:08,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-02-28 10:12:08,187 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 29 states. [2019-02-28 10:12:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:08,640 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-02-28 10:12:08,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-28 10:12:08,640 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-02-28 10:12:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:08,641 INFO L225 Difference]: With dead ends: 59 [2019-02-28 10:12:08,641 INFO L226 Difference]: Without dead ends: 57 [2019-02-28 10:12:08,641 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-28 10:12:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-28 10:12:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-28 10:12:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-28 10:12:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-02-28 10:12:08,666 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 55 [2019-02-28 10:12:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:08,666 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-02-28 10:12:08,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-28 10:12:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-02-28 10:12:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-28 10:12:08,666 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:08,667 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-02-28 10:12:08,667 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:08,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 39 times [2019-02-28 10:12:08,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:08,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:08,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:08,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:08,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:10,738 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-28 10:12:10,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:10,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:10,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:10,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:10,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:10,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:10,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:10,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:10,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:10,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:10,784 WARN L254 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 118 conjunts are in the unsatisfiable core [2019-02-28 10:12:10,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:12,724 INFO L442 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-28 10:12:12,725 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:12,730 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:12,730 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:12:12,807 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-28 10:12:12,807 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:12,877 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:12:12,877 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:12,879 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:12,889 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:12,889 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:12:14,860 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-28 10:12:14,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:14,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 29, 29] total 110 [2019-02-28 10:12:14,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:14,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-28 10:12:14,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-28 10:12:14,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=10368, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:12:14,880 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 83 states. [2019-02-28 10:12:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:19,882 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-02-28 10:12:19,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-28 10:12:19,882 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 56 [2019-02-28 10:12:19,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:19,883 INFO L225 Difference]: With dead ends: 89 [2019-02-28 10:12:19,883 INFO L226 Difference]: Without dead ends: 59 [2019-02-28 10:12:19,884 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-28 10:12:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-28 10:12:19,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-28 10:12:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-28 10:12:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-02-28 10:12:19,909 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-02-28 10:12:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:19,910 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-02-28 10:12:19,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-28 10:12:19,910 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-02-28 10:12:19,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-28 10:12:19,910 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:19,910 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-02-28 10:12:19,910 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:19,911 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 40 times [2019-02-28 10:12:19,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:19,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:19,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:21,819 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-28 10:12:21,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:21,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:21,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:21,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:21,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:21,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:21,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:21,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:21,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 122 conjunts are in the unsatisfiable core [2019-02-28 10:12:21,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:23,729 INFO L442 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-28 10:12:23,730 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:23,735 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:23,735 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:12:23,822 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-28 10:12:23,823 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:23,825 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:12:23,826 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:23,827 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:23,829 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:23,829 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:12:24,584 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-28 10:12:24,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:24,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 87 [2019-02-28 10:12:24,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:24,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-28 10:12:24,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-28 10:12:24,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=7397, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:12:24,604 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 88 states. [2019-02-28 10:12:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:29,128 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-02-28 10:12:29,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-28 10:12:29,128 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 58 [2019-02-28 10:12:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:29,129 INFO L225 Difference]: With dead ends: 90 [2019-02-28 10:12:29,129 INFO L226 Difference]: Without dead ends: 60 [2019-02-28 10:12:29,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 63 SyntacticMatches, 22 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=548, Invalid=13258, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:12:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-28 10:12:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-02-28 10:12:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-28 10:12:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-02-28 10:12:29,157 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2019-02-28 10:12:29,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:29,157 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-02-28 10:12:29,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-28 10:12:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-02-28 10:12:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-28 10:12:29,158 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:29,158 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1] [2019-02-28 10:12:29,158 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:29,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:29,158 INFO L82 PathProgramCache]: Analyzing trace with hash -998989556, now seen corresponding path program 41 times [2019-02-28 10:12:29,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:29,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:29,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:29,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:29,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:29,674 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-28 10:12:29,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:29,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:29,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:29,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:29,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:29,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:29,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:29,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:29,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-28 10:12:29,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:29,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-28 10:12:29,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:29,842 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-28 10:12:29,842 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:30,474 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-28 10:12:30,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:30,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2019-02-28 10:12:30,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:30,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-28 10:12:30,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-28 10:12:30,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-02-28 10:12:30,495 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 31 states. [2019-02-28 10:12:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:30,964 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-02-28 10:12:30,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-28 10:12:30,965 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-02-28 10:12:30,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:30,965 INFO L225 Difference]: With dead ends: 63 [2019-02-28 10:12:30,965 INFO L226 Difference]: Without dead ends: 61 [2019-02-28 10:12:30,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 89 SyntacticMatches, 56 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-02-28 10:12:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-28 10:12:30,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-28 10:12:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-28 10:12:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-02-28 10:12:30,995 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2019-02-28 10:12:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:30,995 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-02-28 10:12:30,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-28 10:12:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-02-28 10:12:30,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-28 10:12:30,995 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:30,995 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-02-28 10:12:30,996 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:30,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:30,996 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 42 times [2019-02-28 10:12:30,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:30,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:30,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:30,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:30,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:33,349 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-28 10:12:33,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:33,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:33,350 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:33,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:33,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:33,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:33,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:33,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:33,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:33,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:33,397 WARN L254 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 126 conjunts are in the unsatisfiable core [2019-02-28 10:12:33,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:35,355 INFO L442 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-28 10:12:35,355 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:35,361 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:35,361 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:12:35,447 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-28 10:12:35,447 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:35,525 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:12:35,525 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:35,526 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:35,537 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:35,537 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:12:37,978 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-28 10:12:37,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:37,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 31, 31] total 118 [2019-02-28 10:12:37,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:37,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-28 10:12:37,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-28 10:12:37,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=11948, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:12:37,998 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 89 states. [2019-02-28 10:12:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:43,410 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2019-02-28 10:12:43,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-28 10:12:43,410 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 60 [2019-02-28 10:12:43,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:43,411 INFO L225 Difference]: With dead ends: 95 [2019-02-28 10:12:43,411 INFO L226 Difference]: Without dead ends: 63 [2019-02-28 10:12:43,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=2983, Invalid=19667, Unknown=0, NotChecked=0, Total=22650 [2019-02-28 10:12:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-28 10:12:43,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-28 10:12:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-28 10:12:43,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-02-28 10:12:43,441 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-02-28 10:12:43,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:43,441 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-02-28 10:12:43,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-28 10:12:43,442 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-02-28 10:12:43,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-28 10:12:43,442 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:43,442 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-02-28 10:12:43,442 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:43,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:43,443 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 43 times [2019-02-28 10:12:43,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:43,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:43,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:43,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:43,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:45,330 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-28 10:12:45,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:45,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:45,331 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:45,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:45,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:45,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:45,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:45,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:45,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 130 conjunts are in the unsatisfiable core [2019-02-28 10:12:45,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:47,794 INFO L442 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-28 10:12:47,795 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:47,799 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:47,800 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:12:47,881 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-28 10:12:47,881 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:47,884 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:12:47,885 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:47,886 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:47,889 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:47,889 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:12:48,760 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-28 10:12:48,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:48,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 93 [2019-02-28 10:12:48,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:48,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-28 10:12:48,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-28 10:12:48,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=8465, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:12:48,779 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 94 states. [2019-02-28 10:12:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:53,878 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-02-28 10:12:53,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-28 10:12:53,878 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 62 [2019-02-28 10:12:53,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:53,879 INFO L225 Difference]: With dead ends: 96 [2019-02-28 10:12:53,879 INFO L226 Difference]: Without dead ends: 64 [2019-02-28 10:12:53,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 24 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=586, Invalid=15164, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:12:53,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-28 10:12:53,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-02-28 10:12:53,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-28 10:12:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-02-28 10:12:53,909 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-02-28 10:12:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:53,910 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-02-28 10:12:53,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-28 10:12:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-02-28 10:12:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-28 10:12:53,910 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:53,910 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1] [2019-02-28 10:12:53,910 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:53,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:53,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1965001236, now seen corresponding path program 44 times [2019-02-28 10:12:53,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:53,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:53,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:53,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:53,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:54,428 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-28 10:12:54,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:54,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:54,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:54,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:54,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:54,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:54,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:54,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:54,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-28 10:12:54,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:54,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-28 10:12:54,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:54,607 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-28 10:12:54,608 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:55,379 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-28 10:12:55,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:55,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2019-02-28 10:12:55,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:55,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-28 10:12:55,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-28 10:12:55,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-02-28 10:12:55,399 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 33 states. [2019-02-28 10:12:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:55,914 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-02-28 10:12:55,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-28 10:12:55,915 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-02-28 10:12:55,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:55,915 INFO L225 Difference]: With dead ends: 67 [2019-02-28 10:12:55,915 INFO L226 Difference]: Without dead ends: 65 [2019-02-28 10:12:55,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 95 SyntacticMatches, 60 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-02-28 10:12:55,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-28 10:12:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-28 10:12:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-28 10:12:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-02-28 10:12:55,947 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 63 [2019-02-28 10:12:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:55,947 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-02-28 10:12:55,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-28 10:12:55,947 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-02-28 10:12:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-28 10:12:55,947 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:55,948 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-02-28 10:12:55,948 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:55,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:55,948 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 45 times [2019-02-28 10:12:55,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:55,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:55,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:55,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:55,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:58,246 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-28 10:12:58,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:58,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:58,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:58,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:58,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:58,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:58,256 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:58,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:58,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:58,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:58,301 WARN L254 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 134 conjunts are in the unsatisfiable core [2019-02-28 10:12:58,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:01,390 INFO L442 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-28 10:13:01,391 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:01,398 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:01,398 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:13:01,488 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-28 10:13:01,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:01,563 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:13:01,563 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:01,564 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:01,575 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:01,575 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:13:04,498 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-28 10:13:04,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:04,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 33, 33] total 126 [2019-02-28 10:13:04,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:04,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-28 10:13:04,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-28 10:13:04,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2110, Invalid=13640, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:13:04,518 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 95 states. [2019-02-28 10:13:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:10,654 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2019-02-28 10:13:10,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-28 10:13:10,655 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 64 [2019-02-28 10:13:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:10,655 INFO L225 Difference]: With dead ends: 101 [2019-02-28 10:13:10,656 INFO L226 Difference]: Without dead ends: 67 [2019-02-28 10:13:10,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3373, Invalid=22387, Unknown=0, NotChecked=0, Total=25760 [2019-02-28 10:13:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-28 10:13:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-28 10:13:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-28 10:13:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-02-28 10:13:10,698 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-02-28 10:13:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:10,698 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-02-28 10:13:10,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-28 10:13:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-02-28 10:13:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-28 10:13:10,699 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:10,699 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-02-28 10:13:10,699 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:10,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:10,699 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 46 times [2019-02-28 10:13:10,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:10,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:10,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:10,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:10,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:13,418 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-28 10:13:13,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:13,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:13,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:13,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:13,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:13,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:13,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:13,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:13,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 138 conjunts are in the unsatisfiable core [2019-02-28 10:13:13,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:15,816 INFO L442 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-28 10:13:15,817 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:15,821 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:15,821 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:13:15,923 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-28 10:13:15,924 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:15,939 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:13:15,939 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:15,940 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:15,942 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:15,942 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:13:16,954 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-28 10:13:16,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:16,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 99 [2019-02-28 10:13:16,973 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:16,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-28 10:13:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-28 10:13:16,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:13:16,974 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 100 states. [2019-02-28 10:13:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:21,755 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-02-28 10:13:21,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-28 10:13:21,755 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 66 [2019-02-28 10:13:21,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:21,756 INFO L225 Difference]: With dead ends: 102 [2019-02-28 10:13:21,756 INFO L226 Difference]: Without dead ends: 68 [2019-02-28 10:13:21,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 72 SyntacticMatches, 25 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:13:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-28 10:13:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-02-28 10:13:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-28 10:13:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-02-28 10:13:21,796 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2019-02-28 10:13:21,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:21,797 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-02-28 10:13:21,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-28 10:13:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-02-28 10:13:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-28 10:13:21,797 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:21,797 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1] [2019-02-28 10:13:21,797 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:21,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:21,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1906113844, now seen corresponding path program 47 times [2019-02-28 10:13:21,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:21,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:21,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:21,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:21,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:22,402 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-28 10:13:22,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:22,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:22,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:22,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:22,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:22,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:22,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:22,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:22,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-28 10:13:22,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:22,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 66 conjunts are in the unsatisfiable core [2019-02-28 10:13:22,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:22,603 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-28 10:13:22,603 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:23,662 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-28 10:13:23,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:23,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2019-02-28 10:13:23,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:23,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-28 10:13:23,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-28 10:13:23,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-02-28 10:13:23,683 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 35 states. [2019-02-28 10:13:24,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:24,274 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-02-28 10:13:24,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-28 10:13:24,274 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-02-28 10:13:24,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:24,275 INFO L225 Difference]: With dead ends: 71 [2019-02-28 10:13:24,275 INFO L226 Difference]: Without dead ends: 69 [2019-02-28 10:13:24,275 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-28 10:13:24,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-28 10:13:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-28 10:13:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-28 10:13:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-02-28 10:13:24,311 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 67 [2019-02-28 10:13:24,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:24,312 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-02-28 10:13:24,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-28 10:13:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-02-28 10:13:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-28 10:13:24,312 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:24,312 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-02-28 10:13:24,312 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:24,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:24,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 48 times [2019-02-28 10:13:24,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:24,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:24,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:24,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:24,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:26,575 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-28 10:13:26,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:26,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:26,576 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:26,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:26,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:26,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:26,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:13:26,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:13:26,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:13:26,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:26,627 WARN L254 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 142 conjunts are in the unsatisfiable core [2019-02-28 10:13:26,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:29,323 INFO L442 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-28 10:13:29,323 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:29,328 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:29,328 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:13:29,434 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-28 10:13:29,435 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:29,518 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:13:29,518 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:29,520 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:29,530 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:29,530 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:13:32,579 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-28 10:13:32,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:32,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 35, 35] total 134 [2019-02-28 10:13:32,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:32,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-28 10:13:32,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-28 10:13:32,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2378, Invalid=15444, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:13:32,610 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 101 states. [2019-02-28 10:13:40,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:40,265 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2019-02-28 10:13:40,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-28 10:13:40,266 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 68 [2019-02-28 10:13:40,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:40,267 INFO L225 Difference]: With dead ends: 107 [2019-02-28 10:13:40,267 INFO L226 Difference]: Without dead ends: 71 [2019-02-28 10:13:40,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=3787, Invalid=25283, Unknown=0, NotChecked=0, Total=29070 [2019-02-28 10:13:40,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-28 10:13:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-28 10:13:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-28 10:13:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-02-28 10:13:40,307 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-02-28 10:13:40,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:40,307 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-02-28 10:13:40,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-28 10:13:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-02-28 10:13:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-28 10:13:40,308 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:40,308 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-02-28 10:13:40,308 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:40,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:40,308 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 49 times [2019-02-28 10:13:40,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:40,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:40,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:40,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:40,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:42,923 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-28 10:13:42,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:42,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:42,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:42,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:42,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:42,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:42,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:42,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:43,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 146 conjunts are in the unsatisfiable core [2019-02-28 10:13:43,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:45,873 INFO L442 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-28 10:13:45,874 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:45,878 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:45,878 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:13:45,970 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-28 10:13:45,971 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:45,973 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:13:45,974 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:45,978 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:45,980 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:45,980 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:13:47,004 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-28 10:13:47,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:47,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 105 [2019-02-28 10:13:47,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:47,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-28 10:13:47,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-28 10:13:47,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:13:47,035 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 106 states. [2019-02-28 10:13:49,502 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-02-28 10:13:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:53,685 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-02-28 10:13:53,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-28 10:13:53,685 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 70 [2019-02-28 10:13:53,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:53,686 INFO L225 Difference]: With dead ends: 108 [2019-02-28 10:13:53,687 INFO L226 Difference]: Without dead ends: 72 [2019-02-28 10:13:53,688 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-28 10:13:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-28 10:13:53,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-02-28 10:13:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-28 10:13:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-02-28 10:13:53,727 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2019-02-28 10:13:53,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:53,727 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-02-28 10:13:53,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-28 10:13:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-02-28 10:13:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-28 10:13:53,728 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:53,728 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1] [2019-02-28 10:13:53,728 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:53,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:53,728 INFO L82 PathProgramCache]: Analyzing trace with hash -227129428, now seen corresponding path program 50 times [2019-02-28 10:13:53,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:53,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:53,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:53,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:53,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:55,127 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-28 10:13:55,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:55,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:55,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:55,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:55,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:55,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:55,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:55,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:55,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-28 10:13:55,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:55,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-28 10:13:55,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:55,351 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-28 10:13:55,351 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:56,347 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-28 10:13:56,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:56,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2019-02-28 10:13:56,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:56,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-28 10:13:56,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-28 10:13:56,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-02-28 10:13:56,367 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 37 states. [2019-02-28 10:13:57,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:57,005 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-02-28 10:13:57,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-28 10:13:57,005 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-02-28 10:13:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:57,006 INFO L225 Difference]: With dead ends: 75 [2019-02-28 10:13:57,006 INFO L226 Difference]: Without dead ends: 73 [2019-02-28 10:13:57,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 107 SyntacticMatches, 68 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-02-28 10:13:57,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-28 10:13:57,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-28 10:13:57,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-28 10:13:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-02-28 10:13:57,047 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2019-02-28 10:13:57,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:57,047 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-02-28 10:13:57,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-28 10:13:57,047 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-02-28 10:13:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-28 10:13:57,048 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:57,048 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-02-28 10:13:57,048 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:57,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 51 times [2019-02-28 10:13:57,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:57,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:57,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:57,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:57,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:01,214 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-28 10:14:01,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:01,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:01,215 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:01,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:01,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:01,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:01,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:14:01,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:14:01,283 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:14:01,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:01,286 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 150 conjunts are in the unsatisfiable core [2019-02-28 10:14:01,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:04,295 INFO L442 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-28 10:14:04,296 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:04,308 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:04,308 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:14:04,410 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-28 10:14:04,410 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:04,499 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:14:04,499 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:04,501 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:04,512 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:04,512 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:14:07,742 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-28 10:14:07,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:07,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 37, 37] total 142 [2019-02-28 10:14:07,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:07,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-28 10:14:07,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-28 10:14:07,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2662, Invalid=17360, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:14:07,761 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 107 states. [2019-02-28 10:14:15,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:15,552 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-02-28 10:14:15,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-02-28 10:14:15,553 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 72 [2019-02-28 10:14:15,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:15,554 INFO L225 Difference]: With dead ends: 113 [2019-02-28 10:14:15,554 INFO L226 Difference]: Without dead ends: 75 [2019-02-28 10:14:15,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=4225, Invalid=28355, Unknown=0, NotChecked=0, Total=32580 [2019-02-28 10:14:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-28 10:14:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-28 10:14:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-28 10:14:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-02-28 10:14:15,595 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-02-28 10:14:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:15,595 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-02-28 10:14:15,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-28 10:14:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-02-28 10:14:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-28 10:14:15,595 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:15,596 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-02-28 10:14:15,596 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:15,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 52 times [2019-02-28 10:14:15,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:15,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:15,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:15,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:15,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:18,642 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-28 10:14:18,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:18,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:18,643 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:18,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:18,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:18,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:18,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:18,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:14:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:18,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 154 conjunts are in the unsatisfiable core [2019-02-28 10:14:18,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:21,918 INFO L442 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-28 10:14:21,918 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:21,923 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:21,923 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:14:22,035 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-28 10:14:22,035 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:22,038 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:14:22,038 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:22,039 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:22,041 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:22,041 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:14:23,197 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-28 10:14:23,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:23,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 111 [2019-02-28 10:14:23,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:23,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-28 10:14:23,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-28 10:14:23,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=12101, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:14:23,217 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 112 states. [2019-02-28 10:14:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:29,956 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-02-28 10:14:29,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-28 10:14:29,956 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 74 [2019-02-28 10:14:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:29,957 INFO L225 Difference]: With dead ends: 114 [2019-02-28 10:14:29,957 INFO L226 Difference]: Without dead ends: 76 [2019-02-28 10:14:29,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 83 SyntacticMatches, 26 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3645 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=700, Invalid=21650, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:14:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-28 10:14:29,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-02-28 10:14:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-28 10:14:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-02-28 10:14:29,998 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-02-28 10:14:29,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:29,998 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-02-28 10:14:29,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-28 10:14:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-02-28 10:14:29,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-28 10:14:29,999 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:29,999 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1] [2019-02-28 10:14:29,999 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:29,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:29,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2146155380, now seen corresponding path program 53 times [2019-02-28 10:14:29,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:30,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:30,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:30,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:30,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:31,115 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-28 10:14:31,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:31,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:31,115 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:31,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:31,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:31,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:31,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:14:31,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:14:31,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-28 10:14:31,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:31,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-28 10:14:31,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:31,347 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-28 10:14:31,347 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:32,491 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-28 10:14:32,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:32,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2019-02-28 10:14:32,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:32,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-28 10:14:32,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-28 10:14:32,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-02-28 10:14:32,511 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 39 states. [2019-02-28 10:14:33,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:33,225 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-02-28 10:14:33,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-28 10:14:33,226 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-02-28 10:14:33,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:33,226 INFO L225 Difference]: With dead ends: 79 [2019-02-28 10:14:33,226 INFO L226 Difference]: Without dead ends: 77 [2019-02-28 10:14:33,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 113 SyntacticMatches, 72 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-02-28 10:14:33,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-28 10:14:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-28 10:14:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:14:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-02-28 10:14:33,285 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 75 [2019-02-28 10:14:33,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:33,285 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-02-28 10:14:33,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-28 10:14:33,286 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-02-28 10:14:33,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-28 10:14:33,286 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:33,286 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-02-28 10:14:33,286 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:33,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:33,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 54 times [2019-02-28 10:14:33,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:33,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:33,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:33,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:33,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:36,447 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-28 10:14:36,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:36,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:36,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:36,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:36,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:36,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:36,456 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:14:36,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:14:36,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:14:36,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:36,504 WARN L254 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 158 conjunts are in the unsatisfiable core [2019-02-28 10:14:36,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:39,578 INFO L442 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-28 10:14:39,578 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:39,582 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:39,582 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:14:39,687 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-28 10:14:39,688 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:39,820 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:14:39,820 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:39,822 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:39,836 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:39,837 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:14:43,495 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-28 10:14:43,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:43,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 39, 39] total 150 [2019-02-28 10:14:43,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:43,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-28 10:14:43,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-28 10:14:43,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2962, Invalid=19388, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:14:43,516 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 113 states. [2019-02-28 10:14:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:52,877 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2019-02-28 10:14:52,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-02-28 10:14:52,878 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 76 [2019-02-28 10:14:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:52,879 INFO L225 Difference]: With dead ends: 119 [2019-02-28 10:14:52,879 INFO L226 Difference]: Without dead ends: 79 [2019-02-28 10:14:52,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=4687, Invalid=31603, Unknown=0, NotChecked=0, Total=36290 [2019-02-28 10:14:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-28 10:14:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-28 10:14:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-28 10:14:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-02-28 10:14:52,942 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-02-28 10:14:52,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:52,942 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-02-28 10:14:52,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-28 10:14:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-02-28 10:14:52,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-28 10:14:52,943 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:52,943 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-02-28 10:14:52,943 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:52,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:52,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 55 times [2019-02-28 10:14:52,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:52,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:52,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:52,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:52,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:56,744 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-28 10:14:56,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:56,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:56,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:56,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:56,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:56,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:56,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:56,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:14:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:56,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 162 conjunts are in the unsatisfiable core [2019-02-28 10:14:56,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:00,228 INFO L442 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-28 10:15:00,229 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:00,232 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:00,232 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:15:00,418 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-28 10:15:00,418 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:00,424 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:15:00,425 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:00,426 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:00,432 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:00,432 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:15:01,871 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-28 10:15:01,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:01,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 117 [2019-02-28 10:15:01,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:01,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-28 10:15:01,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-28 10:15:01,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=13457, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:15:01,893 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 118 states. [2019-02-28 10:15:09,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:09,976 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-02-28 10:15:09,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-28 10:15:09,976 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 78 [2019-02-28 10:15:09,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:09,977 INFO L225 Difference]: With dead ends: 120 [2019-02-28 10:15:09,977 INFO L226 Difference]: Without dead ends: 80 [2019-02-28 10:15:09,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 89 SyntacticMatches, 26 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3995 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=738, Invalid=24068, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:15:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-28 10:15:10,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-02-28 10:15:10,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-28 10:15:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-02-28 10:15:10,032 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2019-02-28 10:15:10,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:10,033 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-02-28 10:15:10,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-28 10:15:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-02-28 10:15:10,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-28 10:15:10,033 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:10,033 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1] [2019-02-28 10:15:10,034 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:10,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:10,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1169619308, now seen corresponding path program 56 times [2019-02-28 10:15:10,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:10,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:10,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:10,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:10,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:11,039 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-28 10:15:11,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:11,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:11,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:11,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:11,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:11,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:11,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:15:11,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:15:11,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-28 10:15:11,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:11,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 78 conjunts are in the unsatisfiable core [2019-02-28 10:15:11,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:11,315 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-28 10:15:11,315 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:12,450 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-28 10:15:12,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:12,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2019-02-28 10:15:12,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:12,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-28 10:15:12,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-28 10:15:12,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-02-28 10:15:12,470 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 41 states. [2019-02-28 10:15:13,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:13,239 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-02-28 10:15:13,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-28 10:15:13,239 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-02-28 10:15:13,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:13,240 INFO L225 Difference]: With dead ends: 83 [2019-02-28 10:15:13,240 INFO L226 Difference]: Without dead ends: 81 [2019-02-28 10:15:13,240 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-28 10:15:13,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-28 10:15:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-28 10:15:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-28 10:15:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-02-28 10:15:13,288 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 79 [2019-02-28 10:15:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:13,289 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-02-28 10:15:13,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-28 10:15:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-02-28 10:15:13,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-28 10:15:13,289 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:13,289 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-02-28 10:15:13,290 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:13,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:13,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 57 times [2019-02-28 10:15:13,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:13,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:13,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:13,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:13,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:16,567 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-28 10:15:16,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:16,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:16,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:16,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:16,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:16,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:16,576 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:15:16,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:15:16,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:15:16,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:16,627 WARN L254 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 166 conjunts are in the unsatisfiable core [2019-02-28 10:15:16,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:21,400 INFO L442 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-28 10:15:21,401 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:21,405 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:21,406 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:15:21,513 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-28 10:15:21,513 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:21,605 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:15:21,606 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:21,607 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:21,618 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:21,619 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:15:25,645 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-28 10:15:25,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:25,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 41, 41] total 158 [2019-02-28 10:15:25,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:25,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-28 10:15:25,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-28 10:15:25,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3278, Invalid=21528, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:15:25,664 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 119 states. [2019-02-28 10:15:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:35,345 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-02-28 10:15:35,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-02-28 10:15:35,345 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 80 [2019-02-28 10:15:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:35,346 INFO L225 Difference]: With dead ends: 125 [2019-02-28 10:15:35,346 INFO L226 Difference]: Without dead ends: 83 [2019-02-28 10:15:35,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=5173, Invalid=35027, Unknown=0, NotChecked=0, Total=40200 [2019-02-28 10:15:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-28 10:15:35,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-28 10:15:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-28 10:15:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-02-28 10:15:35,405 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-02-28 10:15:35,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:35,405 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-02-28 10:15:35,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-28 10:15:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-02-28 10:15:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-28 10:15:35,406 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:35,406 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-02-28 10:15:35,406 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:35,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:35,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 58 times [2019-02-28 10:15:35,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:35,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:35,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:35,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:35,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:38,899 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-28 10:15:38,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:38,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:38,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:38,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:38,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:38,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:38,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:38,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:15:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:39,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 170 conjunts are in the unsatisfiable core [2019-02-28 10:15:39,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:42,797 INFO L442 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-28 10:15:42,798 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:42,802 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:42,803 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:15:42,908 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-28 10:15:42,908 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:42,910 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:15:42,911 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:42,912 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:42,914 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:42,914 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:15:44,343 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-28 10:15:44,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:44,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 123 [2019-02-28 10:15:44,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:44,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-28 10:15:44,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-28 10:15:44,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=14885, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:15:44,363 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 124 states. [2019-02-28 10:15:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:53,084 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2019-02-28 10:15:53,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-28 10:15:53,084 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 82 [2019-02-28 10:15:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:53,085 INFO L225 Difference]: With dead ends: 126 [2019-02-28 10:15:53,086 INFO L226 Difference]: Without dead ends: 84 [2019-02-28 10:15:53,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 93 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4447 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=776, Invalid=26614, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:15:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-28 10:15:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-02-28 10:15:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-28 10:15:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-02-28 10:15:53,137 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2019-02-28 10:15:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:53,137 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-02-28 10:15:53,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-28 10:15:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-02-28 10:15:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-28 10:15:53,138 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:53,138 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1] [2019-02-28 10:15:53,138 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:53,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:53,139 INFO L82 PathProgramCache]: Analyzing trace with hash 928540236, now seen corresponding path program 59 times [2019-02-28 10:15:53,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:53,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:53,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:53,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:53,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:53,828 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-28 10:15:53,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:53,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:53,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:53,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:53,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:53,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:53,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:15:53,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:15:54,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-28 10:15:54,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:54,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-28 10:15:54,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:54,116 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-28 10:15:54,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:55,304 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-28 10:15:55,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:55,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2019-02-28 10:15:55,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:55,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-28 10:15:55,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-28 10:15:55,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-02-28 10:15:55,325 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 43 states. [2019-02-28 10:15:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:56,142 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-02-28 10:15:56,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-28 10:15:56,142 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-02-28 10:15:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:56,143 INFO L225 Difference]: With dead ends: 87 [2019-02-28 10:15:56,144 INFO L226 Difference]: Without dead ends: 85 [2019-02-28 10:15:56,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 125 SyntacticMatches, 80 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-02-28 10:15:56,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-28 10:15:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-28 10:15:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-28 10:15:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-02-28 10:15:56,196 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2019-02-28 10:15:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:56,196 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-02-28 10:15:56,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-28 10:15:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-02-28 10:15:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-28 10:15:56,197 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:56,197 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-02-28 10:15:56,197 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:56,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:56,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 60 times [2019-02-28 10:15:56,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:56,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:56,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:56,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:56,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:59,709 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-28 10:15:59,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:59,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:59,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:59,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:59,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:59,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:59,718 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:15:59,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:15:59,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:15:59,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:59,768 WARN L254 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 174 conjunts are in the unsatisfiable core [2019-02-28 10:15:59,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:03,947 INFO L442 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-28 10:16:03,948 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:03,953 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:03,953 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:16:04,068 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-28 10:16:04,068 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:04,167 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:16:04,167 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:04,168 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:04,179 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:04,179 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:16:08,853 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-28 10:16:08,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:08,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 43, 43] total 166 [2019-02-28 10:16:08,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:08,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-02-28 10:16:08,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-02-28 10:16:08,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3610, Invalid=23780, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:16:08,873 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 125 states. [2019-02-28 10:16:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:19,864 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-02-28 10:16:19,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-02-28 10:16:19,864 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 84 [2019-02-28 10:16:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:19,865 INFO L225 Difference]: With dead ends: 131 [2019-02-28 10:16:19,865 INFO L226 Difference]: Without dead ends: 87 [2019-02-28 10:16:19,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=5683, Invalid=38627, Unknown=0, NotChecked=0, Total=44310 [2019-02-28 10:16:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-28 10:16:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-28 10:16:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-28 10:16:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-02-28 10:16:19,925 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-02-28 10:16:19,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:19,925 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-02-28 10:16:19,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-02-28 10:16:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-02-28 10:16:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-28 10:16:19,926 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:19,926 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-02-28 10:16:19,926 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:19,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:19,926 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 61 times [2019-02-28 10:16:19,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:19,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:19,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:19,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:19,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:23,543 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-28 10:16:23,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:23,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:23,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:23,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:23,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:23,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:16:23,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:23,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:16:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:23,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 178 conjunts are in the unsatisfiable core [2019-02-28 10:16:23,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:27,822 INFO L442 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-28 10:16:27,822 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:27,827 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:27,827 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:16:27,941 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-28 10:16:27,942 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:27,946 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:16:27,946 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:27,948 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:27,950 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:27,950 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:16:29,489 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-28 10:16:29,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:29,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 129 [2019-02-28 10:16:29,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:29,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-28 10:16:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-28 10:16:29,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=16385, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:16:29,521 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 130 states. [2019-02-28 10:16:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:38,967 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2019-02-28 10:16:38,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-28 10:16:38,967 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 86 [2019-02-28 10:16:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:38,968 INFO L225 Difference]: With dead ends: 132 [2019-02-28 10:16:38,968 INFO L226 Difference]: Without dead ends: 88 [2019-02-28 10:16:38,969 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-28 10:16:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-02-28 10:16:39,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-02-28 10:16:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-28 10:16:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-02-28 10:16:39,026 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-02-28 10:16:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:39,026 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-02-28 10:16:39,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-28 10:16:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-02-28 10:16:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-28 10:16:39,027 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:39,027 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1] [2019-02-28 10:16:39,027 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:39,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:39,027 INFO L82 PathProgramCache]: Analyzing trace with hash -831354068, now seen corresponding path program 62 times [2019-02-28 10:16:39,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:39,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:39,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:39,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:39,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:39,859 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-28 10:16:39,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:39,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:39,860 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:39,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:39,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:39,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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:16:39,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:16:39,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:16:40,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-28 10:16:40,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:40,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 86 conjunts are in the unsatisfiable core [2019-02-28 10:16:40,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:40,189 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-28 10:16:40,189 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:41,527 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-28 10:16:41,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:41,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2019-02-28 10:16:41,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:41,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-28 10:16:41,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-28 10:16:41,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-02-28 10:16:41,547 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 45 states. [2019-02-28 10:16:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:42,412 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-02-28 10:16:42,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-28 10:16:42,412 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-02-28 10:16:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:42,413 INFO L225 Difference]: With dead ends: 91 [2019-02-28 10:16:42,413 INFO L226 Difference]: Without dead ends: 89 [2019-02-28 10:16:42,414 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-28 10:16:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-28 10:16:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-28 10:16:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-28 10:16:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-02-28 10:16:42,505 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 87 [2019-02-28 10:16:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:42,505 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-02-28 10:16:42,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-28 10:16:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-02-28 10:16:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-28 10:16:42,506 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:42,506 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-02-28 10:16:42,507 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:42,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 63 times [2019-02-28 10:16:42,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:42,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:42,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:42,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:42,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:46,413 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-28 10:16:46,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:46,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:46,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:46,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:46,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:46,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:16:46,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:16:46,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:16:46,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:16:46,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:46,484 WARN L254 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 182 conjunts are in the unsatisfiable core [2019-02-28 10:16:46,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:51,166 INFO L442 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-28 10:16:51,167 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:51,173 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:51,173 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:16:51,290 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-28 10:16:51,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:51,390 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:16:51,390 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:51,391 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:51,403 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:51,403 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:16:56,496 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-28 10:16:56,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:56,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 45, 45] total 174 [2019-02-28 10:16:56,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:56,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-28 10:16:56,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-28 10:16:56,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3958, Invalid=26144, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:16:56,515 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 131 states. [2019-02-28 10:17:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:08,948 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2019-02-28 10:17:08,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-02-28 10:17:08,949 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 88 [2019-02-28 10:17:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:08,950 INFO L225 Difference]: With dead ends: 137 [2019-02-28 10:17:08,950 INFO L226 Difference]: Without dead ends: 91 [2019-02-28 10:17:08,952 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-28 10:17:08,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-28 10:17:09,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-28 10:17:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-28 10:17:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-02-28 10:17:09,010 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-02-28 10:17:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:09,010 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-02-28 10:17:09,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-28 10:17:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-02-28 10:17:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-28 10:17:09,011 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:09,011 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-02-28 10:17:09,011 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:09,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:09,011 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 64 times [2019-02-28 10:17:09,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:09,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:09,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:09,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:09,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:12,805 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-28 10:17:12,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:12,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:12,805 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:12,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:12,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:12,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:17:12,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:17:12,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:17:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:12,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 186 conjunts are in the unsatisfiable core [2019-02-28 10:17:12,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:17,343 INFO L442 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-28 10:17:17,343 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:17:17,349 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:17,350 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:17:17,468 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-28 10:17:17,469 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:17,475 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:17:17,475 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:17:17,476 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:17,479 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:17,479 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:17:19,312 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-28 10:17:19,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:19,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 135 [2019-02-28 10:17:19,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:19,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-28 10:17:19,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-28 10:17:19,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=17957, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:17:19,333 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 136 states. [2019-02-28 10:17:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:29,554 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2019-02-28 10:17:29,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-28 10:17:29,555 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 90 [2019-02-28 10:17:29,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:29,555 INFO L225 Difference]: With dead ends: 138 [2019-02-28 10:17:29,556 INFO L226 Difference]: Without dead ends: 92 [2019-02-28 10:17:29,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 102 SyntacticMatches, 31 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5376 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=852, Invalid=32090, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:17:29,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-28 10:17:29,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-02-28 10:17:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-28 10:17:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-02-28 10:17:29,615 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2019-02-28 10:17:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:29,615 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-02-28 10:17:29,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-28 10:17:29,615 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-02-28 10:17:29,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-28 10:17:29,615 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:29,616 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1] [2019-02-28 10:17:29,616 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:29,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:29,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1442879476, now seen corresponding path program 65 times [2019-02-28 10:17:29,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:29,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:29,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:17:29,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:29,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:30,417 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-28 10:17:30,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:30,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:30,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:30,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:30,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:30,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:17:30,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:17:30,428 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:17:30,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-28 10:17:30,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:30,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 90 conjunts are in the unsatisfiable core [2019-02-28 10:17:30,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:30,796 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-28 10:17:30,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:32,252 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-28 10:17:32,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:32,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2019-02-28 10:17:32,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:32,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:17:32,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:17:32,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-02-28 10:17:32,273 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 47 states. [2019-02-28 10:17:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:33,212 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-02-28 10:17:33,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-28 10:17:33,212 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-02-28 10:17:33,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:33,213 INFO L225 Difference]: With dead ends: 95 [2019-02-28 10:17:33,213 INFO L226 Difference]: Without dead ends: 93 [2019-02-28 10:17:33,213 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-28 10:17:33,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-28 10:17:33,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-28 10:17:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-28 10:17:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-02-28 10:17:33,276 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 91 [2019-02-28 10:17:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:33,276 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-02-28 10:17:33,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:17:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-02-28 10:17:33,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-28 10:17:33,276 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:33,276 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-02-28 10:17:33,277 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:33,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:33,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 66 times [2019-02-28 10:17:33,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:33,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:33,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:33,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:33,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:37,416 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-28 10:17:37,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:37,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:37,417 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:37,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:37,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:37,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:17:37,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:17:37,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:17:37,478 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:17:37,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:37,482 WARN L254 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 190 conjunts are in the unsatisfiable core [2019-02-28 10:17:37,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:42,159 INFO L442 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-28 10:17:42,159 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:17:42,163 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:42,163 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:17:42,291 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-28 10:17:42,291 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:42,403 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:17:42,403 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:17:42,405 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:42,416 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:42,416 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:17:48,042 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-28 10:17:48,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:48,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 47, 47] total 182 [2019-02-28 10:17:48,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:48,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-02-28 10:17:48,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-02-28 10:17:48,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4322, Invalid=28620, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:17:48,062 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 137 states. [2019-02-28 10:18:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:00,400 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2019-02-28 10:18:00,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-02-28 10:18:00,401 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 92 [2019-02-28 10:18:00,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:00,402 INFO L225 Difference]: With dead ends: 143 [2019-02-28 10:18:00,402 INFO L226 Difference]: Without dead ends: 95 [2019-02-28 10:18:00,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=6775, Invalid=46355, Unknown=0, NotChecked=0, Total=53130 [2019-02-28 10:18:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-28 10:18:00,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-28 10:18:00,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-28 10:18:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-02-28 10:18:00,484 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-02-28 10:18:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:00,485 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-02-28 10:18:00,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-02-28 10:18:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-02-28 10:18:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-28 10:18:00,485 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:00,485 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-02-28 10:18:00,485 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:00,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:00,486 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 67 times [2019-02-28 10:18:00,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:00,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:00,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:00,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:00,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:04,551 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-28 10:18:04,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:04,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:04,552 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:04,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:04,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:04,552 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-28 10:18:04,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:04,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:18:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:04,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 194 conjunts are in the unsatisfiable core [2019-02-28 10:18:04,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:09,469 INFO L442 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-28 10:18:09,470 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:18:09,476 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:18:09,476 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:18:09,598 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-28 10:18:09,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:09,601 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:18:09,601 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:18:09,602 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:18:09,605 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:18:09,605 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:18:11,782 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-28 10:18:11,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:11,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 141 [2019-02-28 10:18:11,800 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:11,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-28 10:18:11,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-28 10:18:11,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=19601, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:18:11,802 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 142 states. [2019-02-28 10:18:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:22,838 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2019-02-28 10:18:22,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-28 10:18:22,838 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 94 [2019-02-28 10:18:22,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:22,839 INFO L225 Difference]: With dead ends: 144 [2019-02-28 10:18:22,839 INFO L226 Difference]: Without dead ends: 96 [2019-02-28 10:18:22,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 106 SyntacticMatches, 33 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5898 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=890, Invalid=35020, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:18:22,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-02-28 10:18:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-02-28 10:18:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-28 10:18:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-02-28 10:18:22,910 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2019-02-28 10:18:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:22,910 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-02-28 10:18:22,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-28 10:18:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-02-28 10:18:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-28 10:18:22,910 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:22,910 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1] [2019-02-28 10:18:22,911 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:22,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:22,911 INFO L82 PathProgramCache]: Analyzing trace with hash 779681004, now seen corresponding path program 68 times [2019-02-28 10:18:22,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:22,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:22,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:22,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:22,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:23,842 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-28 10:18:23,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:23,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:23,843 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:23,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:23,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:23,843 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-28 10:18:23,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:18:23,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:18:24,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-28 10:18:24,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:18:24,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-28 10:18:24,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:24,269 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-28 10:18:24,269 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:25,958 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-28 10:18:25,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:25,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2019-02-28 10:18:25,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:25,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-28 10:18:25,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-28 10:18:25,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-02-28 10:18:25,980 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 49 states. [2019-02-28 10:18:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:27,022 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-02-28 10:18:27,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-28 10:18:27,023 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-02-28 10:18:27,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:27,023 INFO L225 Difference]: With dead ends: 99 [2019-02-28 10:18:27,023 INFO L226 Difference]: Without dead ends: 97 [2019-02-28 10:18:27,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 143 SyntacticMatches, 92 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-02-28 10:18:27,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-28 10:18:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-28 10:18:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-28 10:18:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-02-28 10:18:27,091 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2019-02-28 10:18:27,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:27,091 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-02-28 10:18:27,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-28 10:18:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-02-28 10:18:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-28 10:18:27,092 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:27,092 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-02-28 10:18:27,092 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:27,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:27,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 69 times [2019-02-28 10:18:27,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:27,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:27,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:27,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:27,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:31,525 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-28 10:18:31,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:31,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:31,526 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:31,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:31,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:31,526 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-28 10:18:31,533 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:18:31,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:18:31,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:18:31,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:18:31,594 WARN L254 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 198 conjunts are in the unsatisfiable core [2019-02-28 10:18:31,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:36,914 INFO L442 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-28 10:18:36,915 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:18:36,920 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:18:36,921 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:18:37,054 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-28 10:18:37,055 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:37,162 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:18:37,163 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:18:37,164 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:18:37,174 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:18:37,175 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:18:43,230 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-28 10:18:43,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:43,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 49, 49] total 190 [2019-02-28 10:18:43,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:43,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-02-28 10:18:43,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-02-28 10:18:43,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4702, Invalid=31208, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:18:43,251 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 143 states. [2019-02-28 10:18:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:57,318 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2019-02-28 10:18:57,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-02-28 10:18:57,318 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 96 [2019-02-28 10:18:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:57,319 INFO L225 Difference]: With dead ends: 149 [2019-02-28 10:18:57,319 INFO L226 Difference]: Without dead ends: 99 [2019-02-28 10:18:57,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=7357, Invalid=50483, Unknown=0, NotChecked=0, Total=57840 [2019-02-28 10:18:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-28 10:18:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-28 10:18:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-28 10:18:57,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-02-28 10:18:57,387 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-02-28 10:18:57,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:57,387 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-02-28 10:18:57,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-02-28 10:18:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-02-28 10:18:57,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-28 10:18:57,388 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:57,388 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-02-28 10:18:57,388 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:57,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:57,388 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 70 times [2019-02-28 10:18:57,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:57,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:57,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:57,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:57,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:01,987 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-28 10:19:01,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:01,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:01,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:01,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:01,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:01,987 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-28 10:19:01,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:19:01,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:19:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:02,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 202 conjunts are in the unsatisfiable core [2019-02-28 10:19:02,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:07,216 INFO L442 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-28 10:19:07,216 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:19:07,221 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:07,221 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:19:07,353 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-28 10:19:07,353 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:07,356 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:19:07,356 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:19:07,357 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:07,359 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:07,360 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:19:09,415 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-28 10:19:09,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:09,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 147 [2019-02-28 10:19:09,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:09,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-28 10:19:09,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-28 10:19:09,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=21317, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:19:09,435 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 148 states. [2019-02-28 10:19:20,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:20,195 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2019-02-28 10:19:20,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-28 10:19:20,195 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 98 [2019-02-28 10:19:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:20,196 INFO L225 Difference]: With dead ends: 150 [2019-02-28 10:19:20,196 INFO L226 Difference]: Without dead ends: 100 [2019-02-28 10:19:20,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 110 SyntacticMatches, 35 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6444 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=928, Invalid=38078, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:19:20,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-28 10:19:20,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-02-28 10:19:20,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-28 10:19:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-02-28 10:19:20,267 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-02-28 10:19:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:20,267 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-02-28 10:19:20,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-28 10:19:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-02-28 10:19:20,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-28 10:19:20,267 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:20,268 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1] [2019-02-28 10:19:20,268 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:20,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:20,268 INFO L82 PathProgramCache]: Analyzing trace with hash 634997196, now seen corresponding path program 71 times [2019-02-28 10:19:20,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:20,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:20,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:19:20,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:20,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:21,241 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-28 10:19:21,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:21,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:21,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:21,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:21,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:21,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:19:21,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:19:21,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:19:21,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-28 10:19:21,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:21,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 98 conjunts are in the unsatisfiable core [2019-02-28 10:19:21,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:21,703 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-28 10:19:21,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:23,383 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-28 10:19:23,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:23,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2019-02-28 10:19:23,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:23,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-28 10:19:23,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-28 10:19:23,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-02-28 10:19:23,404 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 51 states. [2019-02-28 10:19:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:24,488 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-02-28 10:19:24,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-28 10:19:24,488 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-02-28 10:19:24,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:24,488 INFO L225 Difference]: With dead ends: 103 [2019-02-28 10:19:24,488 INFO L226 Difference]: Without dead ends: 101 [2019-02-28 10:19:24,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 149 SyntacticMatches, 96 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-02-28 10:19:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-28 10:19:24,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-28 10:19:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-28 10:19:24,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-02-28 10:19:24,561 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 99 [2019-02-28 10:19:24,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:24,561 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-02-28 10:19:24,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-28 10:19:24,561 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-02-28 10:19:24,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-28 10:19:24,561 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:24,561 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-02-28 10:19:24,562 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:24,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:24,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 72 times [2019-02-28 10:19:24,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:24,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:24,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:19:24,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:24,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:29,402 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-28 10:19:29,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:29,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:29,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:29,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:29,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:29,403 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-28 10:19:29,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:19:29,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:19:29,468 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:19:29,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:29,472 WARN L254 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 206 conjunts are in the unsatisfiable core [2019-02-28 10:19:29,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:35,043 INFO L442 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-28 10:19:35,044 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:19:35,048 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:35,049 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:19:35,187 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-28 10:19:35,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:35,337 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:19:35,337 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:19:35,361 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:35,529 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:35,530 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:19:42,446 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-28 10:19:42,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:42,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 51, 51] total 198 [2019-02-28 10:19:42,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:42,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-02-28 10:19:42,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-02-28 10:19:42,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5098, Invalid=33908, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:19:42,467 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 149 states. [2019-02-28 10:19:57,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:57,865 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2019-02-28 10:19:57,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-02-28 10:19:57,866 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 100 [2019-02-28 10:19:57,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:57,867 INFO L225 Difference]: With dead ends: 155 [2019-02-28 10:19:57,867 INFO L226 Difference]: Without dead ends: 103 [2019-02-28 10:19:57,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=7963, Invalid=54787, Unknown=0, NotChecked=0, Total=62750 [2019-02-28 10:19:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-28 10:19:57,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-28 10:19:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-28 10:19:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-02-28 10:19:57,944 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-02-28 10:19:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:57,944 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-02-28 10:19:57,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-02-28 10:19:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-02-28 10:19:57,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-28 10:19:57,945 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:57,945 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-02-28 10:19:57,946 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:57,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:57,946 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 73 times [2019-02-28 10:19:57,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:57,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:19:57,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:57,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:03,110 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-28 10:20:03,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:03,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:03,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:03,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:03,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:03,111 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-28 10:20:03,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:20:03,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:20:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:03,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 210 conjunts are in the unsatisfiable core [2019-02-28 10:20:03,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:09,126 INFO L442 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-28 10:20:09,126 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:20:09,131 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:20:09,131 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:20:09,269 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-28 10:20:09,269 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:09,271 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:20:09,271 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:20:09,272 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:20:09,275 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:20:09,276 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:20:11,533 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-28 10:20:11,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:11,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 153 [2019-02-28 10:20:11,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:11,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-28 10:20:11,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-28 10:20:11,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=23105, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:20:11,553 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 154 states. [2019-02-28 10:20:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:23,463 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-02-28 10:20:23,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-28 10:20:23,463 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 102 [2019-02-28 10:20:23,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:23,464 INFO L225 Difference]: With dead ends: 156 [2019-02-28 10:20:23,464 INFO L226 Difference]: Without dead ends: 104 [2019-02-28 10:20:23,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 114 SyntacticMatches, 37 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7014 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=966, Invalid=41264, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:20:23,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-28 10:20:23,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-02-28 10:20:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-28 10:20:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-02-28 10:20:23,539 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2019-02-28 10:20:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:23,539 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-02-28 10:20:23,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-28 10:20:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-02-28 10:20:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-28 10:20:23,540 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:23,540 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1] [2019-02-28 10:20:23,540 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:23,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:23,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1603948204, now seen corresponding path program 74 times [2019-02-28 10:20:23,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:23,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:23,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:20:23,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:23,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:24,609 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-28 10:20:24,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:24,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:24,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:24,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:24,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:24,609 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-28 10:20:24,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:20:24,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:20:25,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-28 10:20:25,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:20:25,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 102 conjunts are in the unsatisfiable core [2019-02-28 10:20:25,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:25,112 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-28 10:20:25,112 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:26,911 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-28 10:20:26,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:26,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-02-28 10:20:26,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:26,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-28 10:20:26,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-28 10:20:26,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-02-28 10:20:26,933 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 53 states. [2019-02-28 10:20:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:28,358 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-02-28 10:20:28,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-28 10:20:28,358 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-02-28 10:20:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:28,359 INFO L225 Difference]: With dead ends: 107 [2019-02-28 10:20:28,359 INFO L226 Difference]: Without dead ends: 105 [2019-02-28 10:20:28,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 155 SyntacticMatches, 100 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2019-02-28 10:20:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-28 10:20:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-28 10:20:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-28 10:20:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-02-28 10:20:28,440 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 103 [2019-02-28 10:20:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:28,440 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-02-28 10:20:28,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-28 10:20:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-02-28 10:20:28,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-28 10:20:28,441 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:28,441 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-02-28 10:20:28,441 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:28,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 75 times [2019-02-28 10:20:28,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:28,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:28,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:20:28,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:28,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:33,588 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-28 10:20:33,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:33,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:33,589 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:33,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:33,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:33,589 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-28 10:20:33,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:20:33,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:20:33,658 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:20:33,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:20:33,662 WARN L254 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 214 conjunts are in the unsatisfiable core [2019-02-28 10:20:33,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:39,836 INFO L442 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-28 10:20:39,836 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:20:39,840 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:20:39,841 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:20:39,980 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-28 10:20:39,980 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:40,099 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:20:40,099 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:20:40,101 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:20:40,112 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:20:40,112 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:20:47,213 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-28 10:20:47,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:47,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 53, 53] total 206 [2019-02-28 10:20:47,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:47,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-02-28 10:20:47,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-02-28 10:20:47,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5510, Invalid=36720, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:20:47,234 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 155 states. [2019-02-28 10:21:02,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:02,613 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2019-02-28 10:21:02,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-02-28 10:21:02,613 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 104 [2019-02-28 10:21:02,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:02,614 INFO L225 Difference]: With dead ends: 161 [2019-02-28 10:21:02,614 INFO L226 Difference]: Without dead ends: 107 [2019-02-28 10:21:02,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5458 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=8593, Invalid=59267, Unknown=0, NotChecked=0, Total=67860 [2019-02-28 10:21:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-28 10:21:02,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-28 10:21:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-28 10:21:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-02-28 10:21:02,695 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-02-28 10:21:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:02,696 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-02-28 10:21:02,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-02-28 10:21:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-02-28 10:21:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-28 10:21:02,696 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:02,696 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-02-28 10:21:02,696 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:21:02,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:02,697 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 76 times [2019-02-28 10:21:02,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:02,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:02,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:21:02,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:02,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:07,978 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-28 10:21:07,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:07,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:07,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:07,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:07,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:07,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 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-28 10:21:07,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:21:07,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:21:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:08,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 218 conjunts are in the unsatisfiable core [2019-02-28 10:21:08,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:14,350 INFO L442 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-28 10:21:14,351 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:21:14,356 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:21:14,356 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:21:14,498 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-28 10:21:14,499 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:14,501 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:21:14,502 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:21:14,503 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:21:14,505 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:21:14,505 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:21:17,019 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-28 10:21:17,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:17,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 159 [2019-02-28 10:21:17,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:17,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-28 10:21:17,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-28 10:21:17,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=24965, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:21:17,040 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 160 states. [2019-02-28 10:21:28,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:28,999 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2019-02-28 10:21:28,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-02-28 10:21:28,999 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 106 [2019-02-28 10:21:29,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:29,000 INFO L225 Difference]: With dead ends: 162 [2019-02-28 10:21:29,001 INFO L226 Difference]: Without dead ends: 108 [2019-02-28 10:21:29,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 118 SyntacticMatches, 39 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7608 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=1004, Invalid=44578, Unknown=0, NotChecked=0, Total=45582 [2019-02-28 10:21:29,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-28 10:21:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-02-28 10:21:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-28 10:21:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-02-28 10:21:29,101 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2019-02-28 10:21:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:29,101 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-02-28 10:21:29,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-28 10:21:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-02-28 10:21:29,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-28 10:21:29,101 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:29,101 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1] [2019-02-28 10:21:29,101 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:21:29,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:29,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1354107788, now seen corresponding path program 77 times [2019-02-28 10:21:29,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:29,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:29,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:21:29,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:29,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:30,445 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-28 10:21:30,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:30,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:30,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:30,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:30,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:30,446 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-28 10:21:30,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:21:30,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:21:30,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-28 10:21:30,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:21:30,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-28 10:21:30,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:30,996 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-28 10:21:30,996 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:32,871 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-28 10:21:32,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:32,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2019-02-28 10:21:32,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:32,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-28 10:21:32,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-28 10:21:32,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2019-02-28 10:21:32,892 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 55 states. [2019-02-28 10:21:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:34,115 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2019-02-28 10:21:34,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-28 10:21:34,115 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-02-28 10:21:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:34,116 INFO L225 Difference]: With dead ends: 111 [2019-02-28 10:21:34,116 INFO L226 Difference]: Without dead ends: 109 [2019-02-28 10:21:34,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 161 SyntacticMatches, 104 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2019-02-28 10:21:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-28 10:21:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-28 10:21:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-28 10:21:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-02-28 10:21:34,200 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2019-02-28 10:21:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:34,200 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-02-28 10:21:34,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-28 10:21:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-02-28 10:21:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-28 10:21:34,201 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:34,201 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-02-28 10:21:34,201 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:21:34,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:34,201 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 78 times [2019-02-28 10:21:34,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:34,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:34,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:21:34,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:34,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:39,589 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-28 10:21:39,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:39,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:39,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:39,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:39,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:39,590 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-28 10:21:39,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:21:39,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:21:39,662 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:21:39,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:21:39,666 WARN L254 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 222 conjunts are in the unsatisfiable core [2019-02-28 10:21:39,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:46,358 INFO L442 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-28 10:21:46,358 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:21:46,363 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:21:46,364 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:21:46,518 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-28 10:21:46,519 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:46,646 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:21:46,647 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:21:46,648 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:21:46,658 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:21:46,658 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:21:54,351 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-28 10:21:54,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:54,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 55, 55] total 214 [2019-02-28 10:21:54,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:54,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-02-28 10:21:54,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-02-28 10:21:54,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5938, Invalid=39644, Unknown=0, NotChecked=0, Total=45582 [2019-02-28 10:21:54,372 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 161 states. [2019-02-28 10:22:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:11,404 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2019-02-28 10:22:11,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-02-28 10:22:11,404 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 108 [2019-02-28 10:22:11,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:11,405 INFO L225 Difference]: With dead ends: 167 [2019-02-28 10:22:11,406 INFO L226 Difference]: Without dead ends: 111 [2019-02-28 10:22:11,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5884 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=9247, Invalid=63923, Unknown=0, NotChecked=0, Total=73170 [2019-02-28 10:22:11,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-28 10:22:11,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-28 10:22:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-28 10:22:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-02-28 10:22:11,493 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-02-28 10:22:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:11,493 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-02-28 10:22:11,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-02-28 10:22:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-02-28 10:22:11,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-28 10:22:11,493 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:11,494 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-02-28 10:22:11,494 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:11,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:11,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 79 times [2019-02-28 10:22:11,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:11,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:11,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:11,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:11,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:17,159 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-28 10:22:17,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:17,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:17,160 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:17,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:17,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:17,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:22:17,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:17,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:17,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 226 conjunts are in the unsatisfiable core [2019-02-28 10:22:17,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:23,869 INFO L442 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-28 10:22:23,869 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:23,873 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:23,874 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:22:24,024 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-28 10:22:24,024 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:24,026 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:22:24,026 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:24,027 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:24,029 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:24,030 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:22:26,994 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-28 10:22:27,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:27,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 165 [2019-02-28 10:22:27,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:27,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-02-28 10:22:27,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-02-28 10:22:27,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=26897, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:22:27,015 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 166 states. [2019-02-28 10:22:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:40,395 INFO L93 Difference]: Finished difference Result 168 states and 170 transitions. [2019-02-28 10:22:40,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-02-28 10:22:40,395 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 110 [2019-02-28 10:22:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:40,396 INFO L225 Difference]: With dead ends: 168 [2019-02-28 10:22:40,396 INFO L226 Difference]: Without dead ends: 112 [2019-02-28 10:22:40,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 122 SyntacticMatches, 41 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8226 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=1042, Invalid=48020, Unknown=0, NotChecked=0, Total=49062 [2019-02-28 10:22:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-28 10:22:40,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-02-28 10:22:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-28 10:22:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-02-28 10:22:40,485 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2019-02-28 10:22:40,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:40,485 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-02-28 10:22:40,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-02-28 10:22:40,485 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-02-28 10:22:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-28 10:22:40,486 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:40,486 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1] [2019-02-28 10:22:40,486 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:40,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:40,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1280933780, now seen corresponding path program 80 times [2019-02-28 10:22:40,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:40,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:40,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:40,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:40,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:42,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:42,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:42,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:42,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:42,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:42,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:42,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:22:42,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:22:42,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-28 10:22:42,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:42,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 110 conjunts are in the unsatisfiable core [2019-02-28 10:22:42,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:42,679 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:44,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:44,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 56 [2019-02-28 10:22:44,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:44,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-28 10:22:44,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-28 10:22:44,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2019-02-28 10:22:44,773 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 57 states. [2019-02-28 10:22:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:46,069 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2019-02-28 10:22:46,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-28 10:22:46,070 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2019-02-28 10:22:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:46,071 INFO L225 Difference]: With dead ends: 115 [2019-02-28 10:22:46,071 INFO L226 Difference]: Without dead ends: 113 [2019-02-28 10:22:46,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 167 SyntacticMatches, 108 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4620, Invalid=7590, Unknown=0, NotChecked=0, Total=12210 [2019-02-28 10:22:46,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-28 10:22:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-28 10:22:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-28 10:22:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-02-28 10:22:46,159 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 111 [2019-02-28 10:22:46,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:46,159 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-02-28 10:22:46,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-28 10:22:46,160 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-02-28 10:22:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-28 10:22:46,160 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:46,160 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-02-28 10:22:46,160 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:46,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 81 times [2019-02-28 10:22:46,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:46,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:46,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:46,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:46,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:52,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:52,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:52,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:52,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:52,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:52,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:52,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:22:52,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:22:52,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:22:52,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:52,124 WARN L254 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 230 conjunts are in the unsatisfiable core [2019-02-28 10:22:52,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:59,251 INFO L442 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-28 10:22:59,251 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,256 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,256 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:22:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-28 10:22:59,416 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:59,566 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-28 10:22:59,567 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,569 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,578 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,579 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13