java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:37:48,493 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:37:48,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:37:48,507 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:37:48,507 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:37:48,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:37:48,510 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:37:48,512 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:37:48,513 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:37:48,514 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:37:48,515 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:37:48,516 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:37:48,517 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:37:48,518 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:37:48,519 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:37:48,520 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:37:48,521 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:37:48,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:37:48,525 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:37:48,527 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:37:48,528 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:37:48,529 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:37:48,532 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:37:48,532 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:37:48,532 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:37:48,533 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:37:48,534 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:37:48,535 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:37:48,536 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:37:48,537 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:37:48,537 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:37:48,538 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:37:48,538 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:37:48,538 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:37:48,539 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:37:48,540 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:37:48,541 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-28 10:37:48,554 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:37:48,554 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:37:48,555 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:37:48,555 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:37:48,555 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:37:48,555 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:37:48,555 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:37:48,556 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:37:48,556 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:37:48,556 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:37:48,556 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:37:48,556 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:37:48,557 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:37:48,557 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:37:48,557 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:37:48,558 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:37:48,558 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:37:48,558 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:37:48,558 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:37:48,558 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:37:48,559 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:37:48,559 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:37:48,559 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:37:48,559 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:37:48,559 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:37:48,560 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:37:48,560 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:37:48,560 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:37:48,560 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:37:48,560 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:37:48,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:37:48,561 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:37:48,561 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:37:48,561 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:37:48,561 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:37:48,562 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:37:48,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:37:48,562 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:37:48,562 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:37:48,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:37:48,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:37:48,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:37:48,618 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:37:48,619 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:37:48,620 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:37:48,620 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:37:48,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:37:48,658 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:37:48,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:37:48,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:37:48,659 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:37:48,675 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:37:48" (1/1) ... [2019-02-28 10:37:48,686 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:37:48" (1/1) ... [2019-02-28 10:37:48,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:37:48,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:37:48,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:37:48,695 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:37:48,705 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:37:48" (1/1) ... [2019-02-28 10:37:48,706 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:37:48" (1/1) ... [2019-02-28 10:37:48,707 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:37:48" (1/1) ... [2019-02-28 10:37:48,707 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:37:48" (1/1) ... [2019-02-28 10:37:48,711 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:37:48" (1/1) ... [2019-02-28 10:37:48,713 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:37:48" (1/1) ... [2019-02-28 10:37:48,714 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:37:48" (1/1) ... [2019-02-28 10:37:48,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:37:48,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:37:48,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:37:48,716 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:37:48,717 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:37:48" (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:37:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:37:48,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:37:49,045 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:37:49,045 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-02-28 10:37:49,046 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:37:49 BoogieIcfgContainer [2019-02-28 10:37:49,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:37:49,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:37:49,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:37:49,051 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:37:49,051 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:37:48" (1/2) ... [2019-02-28 10:37:49,052 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:37:49, skipping insertion in model container [2019-02-28 10:37:49,052 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:37:49" (2/2) ... [2019-02-28 10:37:49,054 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2019-02-28 10:37:49,064 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:37:49,072 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 10:37:49,090 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 10:37:49,122 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:37:49,122 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:37:49,122 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:37:49,123 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:37:49,123 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:37:49,123 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:37:49,123 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:37:49,123 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:37:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-28 10:37:49,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:37:49,142 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:49,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:37:49,145 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:49,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:49,151 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-28 10:37:49,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:49,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:49,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:49,322 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:37:49,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:37:49,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:37:49,324 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:37:49,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:37:49,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:37:49,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:37:49,345 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-28 10:37:49,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:49,394 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-02-28 10:37:49,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:37:49,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 10:37:49,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:49,413 INFO L225 Difference]: With dead ends: 10 [2019-02-28 10:37:49,413 INFO L226 Difference]: Without dead ends: 6 [2019-02-28 10:37:49,416 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:37:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-28 10:37:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-28 10:37:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 10:37:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-02-28 10:37:49,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-02-28 10:37:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:49,453 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-02-28 10:37:49,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:37:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-02-28 10:37:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:37:49,454 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:49,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:37:49,455 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:49,455 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2019-02-28 10:37:49,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:49,619 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:37:49,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:37:49,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:37:49,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:37:49,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:37:49,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:37:49,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:37:49,623 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-02-28 10:37:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:49,730 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-02-28 10:37:49,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:37:49,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 10:37:49,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:49,732 INFO L225 Difference]: With dead ends: 11 [2019-02-28 10:37:49,732 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 10:37:49,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:37:49,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 10:37:49,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 10:37:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 10:37:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-28 10:37:49,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-02-28 10:37:49,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:49,739 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-28 10:37:49,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:37:49,740 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-28 10:37:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:37:49,740 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:49,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:37:49,741 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:49,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:49,742 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-28 10:37:49,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:49,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:49,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:50,049 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:37:50,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:50,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:50,051 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:37:50,054 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-28 10:37:50,108 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:37:50,108 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:37:50,176 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-02-28 10:38:00,094 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:38:00,096 INFO L272 AbstractInterpreter]: Visited 6 different actions 125 times. Merged at 5 different actions 82 times. Widened at 4 different actions 56 times. Found 36 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:38:00,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:00,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:38:00,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:00,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:00,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:00,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:00,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-28 10:38:00,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:00,470 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:38:00,470 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:00,533 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:00,534 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:38:00,685 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:38:00,686 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:00,713 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:38:00,713 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:00,716 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:00,721 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:00,721 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:38:00,760 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:38:00,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:00,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-28 10:38:00,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:00,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:38:00,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:38:00,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:38:00,784 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 10 states. [2019-02-28 10:38:00,938 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-02-28 10:38:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:01,190 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-02-28 10:38:01,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:38:01,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:38:01,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:01,191 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:38:01,192 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 10:38:01,193 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:38:01,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 10:38:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-28 10:38:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:38:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-02-28 10:38:01,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-02-28 10:38:01,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:01,197 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-02-28 10:38:01,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:38:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-02-28 10:38:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:38:01,198 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:01,198 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-28 10:38:01,199 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:01,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:01,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1949841836, now seen corresponding path program 2 times [2019-02-28 10:38:01,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:01,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:01,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:01,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:01,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:01,298 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:38:01,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:01,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:01,299 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:01,299 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:38:01,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:01,299 INFO 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:38:01,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:01,309 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:01,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 10:38:01,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:01,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:38:01,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:01,344 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:38:01,344 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:01,412 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:38:01,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:01,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-02-28 10:38:01,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:01,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:38:01,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:38:01,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:38:01,433 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-02-28 10:38:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:01,689 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-02-28 10:38:01,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:38:01,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-28 10:38:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:01,691 INFO L225 Difference]: With dead ends: 11 [2019-02-28 10:38:01,691 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 10:38:01,692 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:38:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 10:38:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-28 10:38:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 10:38:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-28 10:38:01,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-02-28 10:38:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:01,696 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-02-28 10:38:01,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:38:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-02-28 10:38:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:38:01,696 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:01,697 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-28 10:38:01,697 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:01,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:01,697 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 3 times [2019-02-28 10:38:01,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:01,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:01,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:01,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:01,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:01,926 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:38:01,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:01,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:01,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:01,927 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:38:01,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:01,928 INFO 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:38:01,937 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:01,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:01,956 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:01,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:01,958 WARN L254 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-28 10:38:01,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:02,084 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:38:02,084 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:02,097 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:02,098 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:38:02,127 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:38:02,127 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:02,208 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:38:02,208 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:02,233 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:02,361 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:02,362 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:38:02,451 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:38:02,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:02,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2019-02-28 10:38:02,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:02,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:38:02,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:38:02,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:38:02,481 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 11 states. [2019-02-28 10:38:02,759 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-02-28 10:38:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:03,096 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-02-28 10:38:03,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-28 10:38:03,101 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-28 10:38:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:03,102 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:38:03,102 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:38:03,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-02-28 10:38:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:38:03,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-28 10:38:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 10:38:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-02-28 10:38:03,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-02-28 10:38:03,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:03,106 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-02-28 10:38:03,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:38:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-02-28 10:38:03,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 10:38:03,107 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:03,107 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-02-28 10:38:03,108 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:03,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:03,108 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 4 times [2019-02-28 10:38:03,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:03,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:03,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:03,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:03,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:03,292 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:38:03,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:03,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:03,292 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:03,293 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:38:03,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:03,293 INFO 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:38:03,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:03,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:03,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-28 10:38:03,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:03,433 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:38:03,434 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:03,442 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:03,442 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:38:03,470 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:38:03,470 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:03,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:38:03,476 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:03,479 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:03,481 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:03,482 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:38:03,507 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:38:03,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:03,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2019-02-28 10:38:03,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:03,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-28 10:38:03,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-28 10:38:03,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:38:03,527 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 16 states. [2019-02-28 10:38:03,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:03,889 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-02-28 10:38:03,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-28 10:38:03,889 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2019-02-28 10:38:03,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:03,890 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:38:03,890 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 10:38:03,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:38:03,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 10:38:03,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-28 10:38:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 10:38:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-02-28 10:38:03,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-02-28 10:38:03,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:03,894 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-02-28 10:38:03,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-28 10:38:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-02-28 10:38:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-28 10:38:03,895 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:03,895 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2019-02-28 10:38:03,896 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:03,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:03,896 INFO L82 PathProgramCache]: Analyzing trace with hash 375043724, now seen corresponding path program 5 times [2019-02-28 10:38:03,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:03,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:03,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:03,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:03,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:03,993 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:38:03,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:03,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:03,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:03,993 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:38:03,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:03,994 INFO 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:38:04,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:04,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:04,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:38:04,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:04,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:38:04,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:04,022 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:38:04,022 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:04,086 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:38:04,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:04,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-02-28 10:38:04,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:04,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:38:04,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:38:04,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:38:04,109 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2019-02-28 10:38:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:04,173 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-02-28 10:38:04,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:38:04,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-02-28 10:38:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:04,175 INFO L225 Difference]: With dead ends: 15 [2019-02-28 10:38:04,175 INFO L226 Difference]: Without dead ends: 13 [2019-02-28 10:38:04,176 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:38:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-28 10:38:04,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-28 10:38:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 10:38:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-02-28 10:38:04,180 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-02-28 10:38:04,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:04,181 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-02-28 10:38:04,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:38:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-02-28 10:38:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-28 10:38:04,181 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:04,182 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-02-28 10:38:04,182 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:04,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:04,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 6 times [2019-02-28 10:38:04,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:04,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:04,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:04,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:04,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:04,378 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:38:04,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:04,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:04,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:04,380 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:38:04,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:04,380 INFO 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:38:04,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:04,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:04,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:04,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:04,410 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-28 10:38:04,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:04,488 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:38:04,488 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:04,495 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:04,495 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:38:04,521 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:38:04,521 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:04,545 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:38:04,545 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:04,546 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:04,556 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:04,557 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:38:04,663 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:38:04,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:04,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2019-02-28 10:38:04,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:04,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-28 10:38:04,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-28 10:38:04,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:38:04,683 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 17 states. [2019-02-28 10:38:05,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:05,186 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-02-28 10:38:05,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-28 10:38:05,186 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2019-02-28 10:38:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:05,187 INFO L225 Difference]: With dead ends: 23 [2019-02-28 10:38:05,187 INFO L226 Difference]: Without dead ends: 15 [2019-02-28 10:38:05,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2019-02-28 10:38:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-28 10:38:05,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-28 10:38:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-28 10:38:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-02-28 10:38:05,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-02-28 10:38:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:05,195 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-02-28 10:38:05,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-28 10:38:05,195 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-02-28 10:38:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-28 10:38:05,195 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:05,196 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-02-28 10:38:05,196 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:05,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:05,196 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 7 times [2019-02-28 10:38:05,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:05,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:05,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:05,680 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:38:05,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:05,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:05,681 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:05,681 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:38:05,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:05,681 INFO 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:38:05,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:05,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:05,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-28 10:38:05,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:05,893 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:38:05,894 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:05,899 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:05,899 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:38:05,926 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:38:05,926 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:05,933 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:38:05,933 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:05,951 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:05,958 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:05,958 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:38:05,983 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:38:06,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:06,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2019-02-28 10:38:06,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:06,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-28 10:38:06,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-28 10:38:06,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:38:06,005 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 22 states. [2019-02-28 10:38:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:06,510 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-02-28 10:38:06,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-28 10:38:06,511 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2019-02-28 10:38:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:06,512 INFO L225 Difference]: With dead ends: 24 [2019-02-28 10:38:06,512 INFO L226 Difference]: Without dead ends: 16 [2019-02-28 10:38:06,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:38:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-28 10:38:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-02-28 10:38:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:38:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-02-28 10:38:06,518 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-02-28 10:38:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:06,518 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-02-28 10:38:06,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-28 10:38:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-02-28 10:38:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-28 10:38:06,519 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:06,519 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2019-02-28 10:38:06,519 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:06,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:06,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1662915732, now seen corresponding path program 8 times [2019-02-28 10:38:06,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:06,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:06,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:06,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:06,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:06,670 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:38:06,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:06,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:06,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:06,670 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:38:06,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:06,671 INFO 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:38:06,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:06,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:06,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-28 10:38:06,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:06,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:38:06,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:06,747 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:38:06,747 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:07,072 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:38:07,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:07,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2019-02-28 10:38:07,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:07,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:38:07,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:38:07,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:38:07,094 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2019-02-28 10:38:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:07,248 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-02-28 10:38:07,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-28 10:38:07,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-02-28 10:38:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:07,250 INFO L225 Difference]: With dead ends: 19 [2019-02-28 10:38:07,250 INFO L226 Difference]: Without dead ends: 17 [2019-02-28 10:38:07,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:38:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-28 10:38:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-28 10:38:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:38:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-02-28 10:38:07,256 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-02-28 10:38:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:07,256 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-02-28 10:38:07,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:38:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-02-28 10:38:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-28 10:38:07,257 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:07,257 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-02-28 10:38:07,257 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:07,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:07,257 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 9 times [2019-02-28 10:38:07,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:07,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:07,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:07,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:07,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:07,539 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:38:07,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:07,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:07,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:07,540 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:38:07,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:07,540 INFO 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:38:07,559 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:07,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:07,573 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:07,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:07,574 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-28 10:38:07,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:07,730 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:38:07,730 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:07,736 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:07,736 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:38:07,782 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:38:07,782 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:07,860 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:38:07,861 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:07,866 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:07,884 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:07,885 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:38:08,265 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:38:08,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:08,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2019-02-28 10:38:08,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:08,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-28 10:38:08,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-28 10:38:08,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:38:08,286 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 23 states. [2019-02-28 10:38:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:09,010 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-02-28 10:38:09,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-28 10:38:09,012 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2019-02-28 10:38:09,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:09,013 INFO L225 Difference]: With dead ends: 29 [2019-02-28 10:38:09,013 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:38:09,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2019-02-28 10:38:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:38:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-28 10:38:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-28 10:38:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-02-28 10:38:09,023 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-02-28 10:38:09,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:09,023 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-02-28 10:38:09,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-28 10:38:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-02-28 10:38:09,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-28 10:38:09,024 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:09,024 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-02-28 10:38:09,025 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:09,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:09,025 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 10 times [2019-02-28 10:38:09,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:09,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:09,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:09,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:09,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:09,402 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:38:09,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:09,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:09,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:09,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:38:09,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:09,404 INFO 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:38:09,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:09,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:09,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-28 10:38:09,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:09,645 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:38:09,646 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:09,652 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:09,652 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:38:09,684 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:38:09,684 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:09,689 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:38:09,690 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:09,691 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:09,693 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:09,693 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:38:09,737 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:38:09,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:09,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2019-02-28 10:38:09,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:09,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-28 10:38:09,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-28 10:38:09,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:38:09,758 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 28 states. [2019-02-28 10:38:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:10,439 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-02-28 10:38:10,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-28 10:38:10,440 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 18 [2019-02-28 10:38:10,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:10,440 INFO L225 Difference]: With dead ends: 30 [2019-02-28 10:38:10,441 INFO L226 Difference]: Without dead ends: 20 [2019-02-28 10:38:10,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:38:10,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-28 10:38:10,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-02-28 10:38:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-28 10:38:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-02-28 10:38:10,447 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2019-02-28 10:38:10,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:10,448 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-02-28 10:38:10,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-28 10:38:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-02-28 10:38:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-28 10:38:10,448 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:10,449 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2019-02-28 10:38:10,449 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:10,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:10,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1547184052, now seen corresponding path program 11 times [2019-02-28 10:38:10,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:10,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:10,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:10,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:10,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:10,566 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:38:10,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:10,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:10,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:10,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:38:10,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:10,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:10,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:10,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:10,598 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-28 10:38:10,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:10,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-28 10:38:10,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:10,606 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:38:10,607 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:10,737 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:38:10,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:10,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2019-02-28 10:38:10,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:10,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:38:10,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:38:10,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:38:10,762 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-02-28 10:38:11,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:11,042 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-02-28 10:38:11,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-28 10:38:11,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-02-28 10:38:11,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:11,044 INFO L225 Difference]: With dead ends: 23 [2019-02-28 10:38:11,044 INFO L226 Difference]: Without dead ends: 21 [2019-02-28 10:38:11,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:38:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-28 10:38:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-28 10:38:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-28 10:38:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-02-28 10:38:11,052 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-02-28 10:38:11,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:11,053 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-02-28 10:38:11,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:38:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-02-28 10:38:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-28 10:38:11,054 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:11,054 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-02-28 10:38:11,054 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:11,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:11,054 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 12 times [2019-02-28 10:38:11,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:11,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:11,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:11,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:11,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:11,603 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:38:11,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:11,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:11,604 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:11,604 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:38:11,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:11,604 INFO 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:38:11,614 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:11,614 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:11,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:11,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:11,628 WARN L254 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-28 10:38:11,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:11,824 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:38:11,825 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:11,829 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:11,829 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:38:11,861 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:38:11,861 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:11,916 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:38:11,916 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:11,919 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:11,930 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:11,931 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:38:12,234 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:38:12,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:12,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 38 [2019-02-28 10:38:12,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:12,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-28 10:38:12,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-28 10:38:12,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:38:12,254 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 29 states. [2019-02-28 10:38:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:13,289 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-02-28 10:38:13,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-28 10:38:13,290 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-02-28 10:38:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:13,291 INFO L225 Difference]: With dead ends: 35 [2019-02-28 10:38:13,291 INFO L226 Difference]: Without dead ends: 23 [2019-02-28 10:38:13,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=403, Invalid=2147, Unknown=0, NotChecked=0, Total=2550 [2019-02-28 10:38:13,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-28 10:38:13,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-28 10:38:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-28 10:38:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-02-28 10:38:13,300 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-02-28 10:38:13,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:13,301 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-02-28 10:38:13,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-28 10:38:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-02-28 10:38:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-28 10:38:13,302 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:13,302 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-02-28 10:38:13,302 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:13,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:13,302 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 13 times [2019-02-28 10:38:13,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:13,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:13,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:13,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:13,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:13,820 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:38:13,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:13,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:13,821 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:13,821 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:38:13,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:13,821 INFO 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:38:13,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:13,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:13,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-28 10:38:13,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:14,247 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:38:14,248 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:14,252 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:14,252 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:38:14,286 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:38:14,287 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:14,290 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:38:14,291 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:14,316 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:14,318 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:14,318 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:38:14,385 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:38:14,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:14,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2019-02-28 10:38:14,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:14,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-28 10:38:14,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-28 10:38:14,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:38:14,405 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 34 states. [2019-02-28 10:38:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:15,292 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-02-28 10:38:15,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-28 10:38:15,292 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2019-02-28 10:38:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:15,293 INFO L225 Difference]: With dead ends: 36 [2019-02-28 10:38:15,294 INFO L226 Difference]: Without dead ends: 24 [2019-02-28 10:38:15,295 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:38:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-28 10:38:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-02-28 10:38:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-28 10:38:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-02-28 10:38:15,304 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-02-28 10:38:15,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:15,305 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-02-28 10:38:15,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-28 10:38:15,305 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-02-28 10:38:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-28 10:38:15,306 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:15,306 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2019-02-28 10:38:15,306 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:15,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:15,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1283882284, now seen corresponding path program 14 times [2019-02-28 10:38:15,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:15,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:15,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:15,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:15,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:15,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:38:15,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:15,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:15,901 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:15,901 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:38:15,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:15,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:15,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:15,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:15,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-28 10:38:15,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:15,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-28 10:38:15,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:15,952 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:38:15,952 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:16,151 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:38:16,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:16,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2019-02-28 10:38:16,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:16,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:38:16,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:38:16,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:38:16,172 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 13 states. [2019-02-28 10:38:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:16,305 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-02-28 10:38:16,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-28 10:38:16,305 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-02-28 10:38:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:16,306 INFO L225 Difference]: With dead ends: 27 [2019-02-28 10:38:16,306 INFO L226 Difference]: Without dead ends: 25 [2019-02-28 10:38:16,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 20 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:38:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-28 10:38:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-28 10:38:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-28 10:38:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-02-28 10:38:16,316 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2019-02-28 10:38:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:16,317 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-02-28 10:38:16,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:38:16,317 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-02-28 10:38:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-28 10:38:16,317 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:16,318 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-02-28 10:38:16,318 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:16,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:16,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 15 times [2019-02-28 10:38:16,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:16,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:16,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:16,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:16,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:16,759 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:38:16,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:16,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:16,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:16,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:38:16,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:16,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 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:38:16,769 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:16,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:16,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:16,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:16,784 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-28 10:38:16,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:17,088 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:38:17,089 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:17,094 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:17,095 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:38:17,132 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:38:17,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:17,166 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:38:17,166 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:17,173 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:17,183 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:17,184 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:38:17,561 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:38:17,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:17,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 46 [2019-02-28 10:38:17,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:17,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-28 10:38:17,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-28 10:38:17,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:38:17,582 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2019-02-28 10:38:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:19,271 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-02-28 10:38:19,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-28 10:38:19,272 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2019-02-28 10:38:19,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:19,272 INFO L225 Difference]: With dead ends: 41 [2019-02-28 10:38:19,272 INFO L226 Difference]: Without dead ends: 27 [2019-02-28 10:38:19,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=553, Invalid=3107, Unknown=0, NotChecked=0, Total=3660 [2019-02-28 10:38:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-28 10:38:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-28 10:38:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-28 10:38:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-02-28 10:38:19,284 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-02-28 10:38:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:19,284 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-02-28 10:38:19,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-28 10:38:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-02-28 10:38:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-28 10:38:19,285 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:19,286 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-02-28 10:38:19,286 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:19,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:19,286 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 16 times [2019-02-28 10:38:19,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:19,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:19,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:19,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:19,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:19,758 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:38:19,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:19,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:19,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:19,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:38:19,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:19,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 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:38:19,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:19,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:19,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-28 10:38:19,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:20,313 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:38:20,314 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:20,318 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:20,319 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:38:20,355 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:38:20,356 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:20,359 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:38:20,359 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:20,360 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:20,363 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:20,363 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:38:20,456 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:38:20,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:20,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2019-02-28 10:38:20,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:20,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-28 10:38:20,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-28 10:38:20,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:38:20,485 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 40 states. [2019-02-28 10:38:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:21,662 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-02-28 10:38:21,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-28 10:38:21,663 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2019-02-28 10:38:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:21,664 INFO L225 Difference]: With dead ends: 42 [2019-02-28 10:38:21,664 INFO L226 Difference]: Without dead ends: 28 [2019-02-28 10:38:21,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=244, Invalid=2618, Unknown=0, NotChecked=0, Total=2862 [2019-02-28 10:38:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-28 10:38:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-02-28 10:38:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-28 10:38:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-02-28 10:38:21,676 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-02-28 10:38:21,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:21,677 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-02-28 10:38:21,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-28 10:38:21,677 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-02-28 10:38:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-28 10:38:21,677 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:21,678 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2019-02-28 10:38:21,678 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:21,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:21,678 INFO L82 PathProgramCache]: Analyzing trace with hash -568862196, now seen corresponding path program 17 times [2019-02-28 10:38:21,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:21,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:21,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:21,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:21,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:21,933 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:38:21,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:21,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:21,934 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:21,934 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:38:21,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:21,934 INFO 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:38:21,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:21,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:21,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-28 10:38:21,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:21,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-28 10:38:21,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:21,994 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:38:21,994 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:22,154 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:38:22,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:22,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2019-02-28 10:38:22,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:22,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-28 10:38:22,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-28 10:38:22,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:38:22,174 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 15 states. [2019-02-28 10:38:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:22,405 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-02-28 10:38:22,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-28 10:38:22,406 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-02-28 10:38:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:22,407 INFO L225 Difference]: With dead ends: 31 [2019-02-28 10:38:22,407 INFO L226 Difference]: Without dead ends: 29 [2019-02-28 10:38:22,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 24 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-02-28 10:38:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-28 10:38:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-28 10:38:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-28 10:38:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-02-28 10:38:22,420 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2019-02-28 10:38:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:22,420 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-02-28 10:38:22,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-28 10:38:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-02-28 10:38:22,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-28 10:38:22,421 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:22,421 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-02-28 10:38:22,421 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:22,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:22,422 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 18 times [2019-02-28 10:38:22,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:22,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:22,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:22,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:22,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:23,038 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:38:23,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:23,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:23,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:23,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:38:23,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:23,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 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:38:23,048 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:23,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:23,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:23,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:23,066 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-28 10:38:23,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:23,845 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:38:23,846 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:23,850 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:23,850 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:38:23,889 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:38:23,889 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:23,929 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:38:23,930 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:23,931 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:23,941 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:23,942 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:38:25,763 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:38:25,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:25,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 15] total 54 [2019-02-28 10:38:25,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:25,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-28 10:38:25,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-28 10:38:25,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2444, Unknown=0, NotChecked=0, Total=2862 [2019-02-28 10:38:25,784 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2019-02-28 10:38:26,882 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-02-28 10:38:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:28,092 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-02-28 10:38:28,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-28 10:38:28,093 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 28 [2019-02-28 10:38:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:28,094 INFO L225 Difference]: With dead ends: 47 [2019-02-28 10:38:28,094 INFO L226 Difference]: Without dead ends: 31 [2019-02-28 10:38:28,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=727, Invalid=4243, Unknown=0, NotChecked=0, Total=4970 [2019-02-28 10:38:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-28 10:38:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-28 10:38:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-28 10:38:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-02-28 10:38:28,106 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-02-28 10:38:28,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:28,107 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-02-28 10:38:28,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-28 10:38:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-02-28 10:38:28,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-28 10:38:28,107 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:28,108 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-02-28 10:38:28,108 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:28,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:28,108 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 19 times [2019-02-28 10:38:28,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:28,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:28,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:28,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:28,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:28,942 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:38:28,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:28,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:28,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:28,943 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:38:28,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:28,943 INFO 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:38:28,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:28,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:28,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 66 conjunts are in the unsatisfiable core [2019-02-28 10:38:28,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:29,534 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:38:29,534 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:29,540 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:29,541 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:38:29,586 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:38:29,586 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:29,589 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:38:29,589 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:29,592 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:29,594 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:29,594 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:38:29,730 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:38:29,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:29,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2019-02-28 10:38:29,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:29,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-28 10:38:29,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-28 10:38:29,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:38:29,753 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 46 states. [2019-02-28 10:38:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:31,065 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-02-28 10:38:31,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-28 10:38:31,065 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2019-02-28 10:38:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:31,066 INFO L225 Difference]: With dead ends: 48 [2019-02-28 10:38:31,066 INFO L226 Difference]: Without dead ends: 32 [2019-02-28 10:38:31,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:38:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-28 10:38:31,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-02-28 10:38:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-28 10:38:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-02-28 10:38:31,078 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2019-02-28 10:38:31,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:31,078 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-02-28 10:38:31,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-28 10:38:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-02-28 10:38:31,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-28 10:38:31,079 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:31,079 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1] [2019-02-28 10:38:31,080 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:31,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:31,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1693839084, now seen corresponding path program 20 times [2019-02-28 10:38:31,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:31,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:31,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:31,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:31,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:31,628 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:38:31,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:31,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:31,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:31,628 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:38:31,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:31,628 INFO 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:38:31,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:31,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:31,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-28 10:38:31,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:31,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-28 10:38:31,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:31,696 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:38:31,696 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:31,859 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:38:31,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:31,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2019-02-28 10:38:31,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:31,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-28 10:38:31,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-28 10:38:31,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:38:31,879 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2019-02-28 10:38:32,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:32,102 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-02-28 10:38:32,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-28 10:38:32,105 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-02-28 10:38:32,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:32,106 INFO L225 Difference]: With dead ends: 35 [2019-02-28 10:38:32,106 INFO L226 Difference]: Without dead ends: 33 [2019-02-28 10:38:32,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-02-28 10:38:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-28 10:38:32,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-28 10:38:32,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-28 10:38:32,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-02-28 10:38:32,122 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2019-02-28 10:38:32,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:32,122 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-02-28 10:38:32,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-28 10:38:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-02-28 10:38:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-28 10:38:32,123 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:32,123 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-02-28 10:38:32,123 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:32,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:32,124 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 21 times [2019-02-28 10:38:32,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:32,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:32,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:32,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:32,769 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:38:32,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:32,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:32,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:32,770 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:38:32,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:32,770 INFO 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:38:32,778 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:32,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:32,797 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:32,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:32,799 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-28 10:38:32,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:33,336 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:38:33,337 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:33,341 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:33,342 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:38:33,403 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:38:33,403 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:33,494 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:38:33,494 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:33,496 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:33,513 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:33,514 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:38:34,265 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:38:34,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:34,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17, 17] total 62 [2019-02-28 10:38:34,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:34,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:38:34,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:38:34,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=3240, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:38:34,287 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 47 states. [2019-02-28 10:38:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:36,153 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-02-28 10:38:36,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-28 10:38:36,154 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 32 [2019-02-28 10:38:36,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:36,155 INFO L225 Difference]: With dead ends: 53 [2019-02-28 10:38:36,155 INFO L226 Difference]: Without dead ends: 35 [2019-02-28 10:38:36,157 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:38:36,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-28 10:38:36,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-28 10:38:36,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-28 10:38:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-02-28 10:38:36,168 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-02-28 10:38:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:36,168 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-02-28 10:38:36,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:38:36,168 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-02-28 10:38:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-28 10:38:36,169 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:36,169 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-02-28 10:38:36,169 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:36,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:36,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 22 times [2019-02-28 10:38:36,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:36,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:36,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:36,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:36,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:37,445 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:38:37,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:37,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:37,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:37,445 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:38:37,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:37,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 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:38:37,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:37,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:37,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-28 10:38:37,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:38,148 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:38:38,149 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:38,153 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:38,153 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:38:38,200 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:38:38,201 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:38,203 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:38:38,203 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:38,205 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:38,208 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:38,208 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:38:38,390 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:38:38,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:38,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2019-02-28 10:38:38,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:38,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-28 10:38:38,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-28 10:38:38,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2501, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:38:38,411 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 52 states. [2019-02-28 10:38:40,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:40,341 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-02-28 10:38:40,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-28 10:38:40,341 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 34 [2019-02-28 10:38:40,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:40,341 INFO L225 Difference]: With dead ends: 54 [2019-02-28 10:38:40,342 INFO L226 Difference]: Without dead ends: 36 [2019-02-28 10:38:40,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=320, Invalid=4510, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:38:40,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-28 10:38:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-02-28 10:38:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-28 10:38:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-02-28 10:38:40,357 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2019-02-28 10:38:40,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:40,357 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-02-28 10:38:40,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-28 10:38:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-02-28 10:38:40,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-28 10:38:40,358 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:40,358 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1] [2019-02-28 10:38:40,358 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:40,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1394260940, now seen corresponding path program 23 times [2019-02-28 10:38:40,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:40,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:40,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:40,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:40,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:40,635 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:38:40,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:40,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:40,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:40,636 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:38:40,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:40,636 INFO 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:38:40,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:40,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:40,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-28 10:38:40,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:40,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-28 10:38:40,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:40,709 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:38:40,709 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:40,934 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:38:40,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:40,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2019-02-28 10:38:40,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:40,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-28 10:38:40,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-28 10:38:40,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:38:40,955 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2019-02-28 10:38:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:41,182 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-02-28 10:38:41,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-28 10:38:41,183 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-02-28 10:38:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:41,183 INFO L225 Difference]: With dead ends: 39 [2019-02-28 10:38:41,184 INFO L226 Difference]: Without dead ends: 37 [2019-02-28 10:38:41,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 32 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-02-28 10:38:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-28 10:38:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-28 10:38:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-28 10:38:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-02-28 10:38:41,202 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-02-28 10:38:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:41,202 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-02-28 10:38:41,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-28 10:38:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-02-28 10:38:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-28 10:38:41,203 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:41,203 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-02-28 10:38:41,203 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:41,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:41,203 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 24 times [2019-02-28 10:38:41,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:41,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:41,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:41,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:41,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:41,991 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:38:41,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:41,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:41,992 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:41,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:38:41,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:41,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 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:38:42,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:42,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:42,043 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:42,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:42,045 WARN L254 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 78 conjunts are in the unsatisfiable core [2019-02-28 10:38:42,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:42,766 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:38:42,767 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:42,772 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:42,772 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:38:42,822 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:38:42,822 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:42,875 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:38:42,875 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:42,878 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:42,888 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:42,889 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:38:43,849 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:38:43,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:43,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19, 19] total 70 [2019-02-28 10:38:43,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:43,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-28 10:38:43,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-28 10:38:43,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=4148, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:38:43,870 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 53 states. [2019-02-28 10:38:44,679 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2019-02-28 10:38:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:46,431 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-02-28 10:38:46,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-28 10:38:46,431 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 36 [2019-02-28 10:38:46,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:46,432 INFO L225 Difference]: With dead ends: 59 [2019-02-28 10:38:46,432 INFO L226 Difference]: Without dead ends: 39 [2019-02-28 10:38:46,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1147, Invalid=7043, Unknown=0, NotChecked=0, Total=8190 [2019-02-28 10:38:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-28 10:38:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-28 10:38:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-28 10:38:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-02-28 10:38:46,450 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-02-28 10:38:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:46,451 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-02-28 10:38:46,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-28 10:38:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-02-28 10:38:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-28 10:38:46,451 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:46,451 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-02-28 10:38:46,452 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:46,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:46,452 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 25 times [2019-02-28 10:38:46,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:46,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:46,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:46,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:46,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:47,454 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:38:47,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:47,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:47,454 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:47,455 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:38:47,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:47,455 INFO 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:38:47,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:47,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:47,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-28 10:38:47,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:48,373 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:38:48,374 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:48,380 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:48,381 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:38:48,433 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:38:48,433 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:48,436 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:38:48,436 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:48,437 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:48,440 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:48,440 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:38:48,684 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:38:48,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:48,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2019-02-28 10:38:48,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:48,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-28 10:38:48,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-28 10:38:48,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:38:48,704 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 58 states. [2019-02-28 10:38:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:50,964 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-02-28 10:38:50,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-28 10:38:50,965 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 38 [2019-02-28 10:38:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:50,965 INFO L225 Difference]: With dead ends: 60 [2019-02-28 10:38:50,966 INFO L226 Difference]: Without dead ends: 40 [2019-02-28 10:38:50,967 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:38:50,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-28 10:38:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-02-28 10:38:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-28 10:38:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-02-28 10:38:50,985 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-02-28 10:38:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:50,985 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-02-28 10:38:50,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-28 10:38:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-02-28 10:38:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-28 10:38:50,986 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:50,986 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1] [2019-02-28 10:38:50,986 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:50,986 INFO L82 PathProgramCache]: Analyzing trace with hash 536887468, now seen corresponding path program 26 times [2019-02-28 10:38:50,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:50,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:50,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:50,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:50,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:51,750 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:38:51,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:51,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:51,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:51,751 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:38:51,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:51,751 INFO 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:38:51,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:51,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:51,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-28 10:38:51,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:51,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-28 10:38:51,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:51,838 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:38:51,839 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:52,129 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:38:52,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:52,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2019-02-28 10:38:52,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:52,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-28 10:38:52,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-28 10:38:52,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-02-28 10:38:52,150 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 21 states. [2019-02-28 10:38:52,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:52,422 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-02-28 10:38:52,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-28 10:38:52,422 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-02-28 10:38:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:52,422 INFO L225 Difference]: With dead ends: 43 [2019-02-28 10:38:52,422 INFO L226 Difference]: Without dead ends: 41 [2019-02-28 10:38:52,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 36 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-02-28 10:38:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-28 10:38:52,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-28 10:38:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:38:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-02-28 10:38:52,438 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2019-02-28 10:38:52,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:52,438 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-02-28 10:38:52,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-28 10:38:52,439 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-02-28 10:38:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-28 10:38:52,439 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:52,439 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-02-28 10:38:52,439 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:52,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:52,439 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 27 times [2019-02-28 10:38:52,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:52,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:52,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:52,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:52,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:53,424 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:38:53,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:53,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:53,424 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:53,425 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:38:53,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:53,425 INFO 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:38:53,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:53,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:53,460 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:53,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:53,461 WARN L254 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 86 conjunts are in the unsatisfiable core [2019-02-28 10:38:53,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:54,554 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:38:54,555 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:54,559 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:54,560 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:38:54,622 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:38:54,622 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:54,712 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:38:54,713 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:54,737 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:54,793 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:54,793 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:38:55,814 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:38:55,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:55,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 21, 21] total 78 [2019-02-28 10:38:55,834 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:55,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-28 10:38:55,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-28 10:38:55,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=5168, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:38:55,835 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 59 states. [2019-02-28 10:38:58,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:58,500 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-02-28 10:38:58,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-28 10:38:58,501 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 40 [2019-02-28 10:38:58,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:58,502 INFO L225 Difference]: With dead ends: 65 [2019-02-28 10:38:58,502 INFO L226 Difference]: Without dead ends: 43 [2019-02-28 10:38:58,504 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:38:58,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-28 10:38:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-28 10:38:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-28 10:38:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-02-28 10:38:58,526 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-02-28 10:38:58,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:58,527 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-02-28 10:38:58,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-28 10:38:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-02-28 10:38:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-28 10:38:58,527 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:58,527 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-02-28 10:38:58,528 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:58,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:58,528 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 28 times [2019-02-28 10:38:58,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:58,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:58,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:58,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:58,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:59,665 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:38:59,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:59,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:59,666 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:59,666 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:38:59,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:59,666 INFO 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:38:59,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:59,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:59,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 90 conjunts are in the unsatisfiable core [2019-02-28 10:38:59,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:00,699 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:39:00,699 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:00,703 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:00,703 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:39:00,762 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:39:00,763 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:00,765 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:39:00,766 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:00,767 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:00,769 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:00,769 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:39:01,128 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:39:01,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:01,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2019-02-28 10:39:01,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:01,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-28 10:39:01,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-28 10:39:01,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3845, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:39:01,148 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 64 states. [2019-02-28 10:39:03,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:03,600 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-02-28 10:39:03,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-28 10:39:03,601 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 42 [2019-02-28 10:39:03,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:03,601 INFO L225 Difference]: With dead ends: 66 [2019-02-28 10:39:03,602 INFO L226 Difference]: Without dead ends: 44 [2019-02-28 10:39:03,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 47 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=396, Invalid=6914, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:39:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-28 10:39:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-02-28 10:39:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-28 10:39:03,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-02-28 10:39:03,626 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2019-02-28 10:39:03,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:03,626 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-02-28 10:39:03,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-28 10:39:03,627 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-02-28 10:39:03,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-28 10:39:03,627 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:03,627 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1] [2019-02-28 10:39:03,627 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:03,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:03,628 INFO L82 PathProgramCache]: Analyzing trace with hash -392135284, now seen corresponding path program 29 times [2019-02-28 10:39:03,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:03,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:03,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:03,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:03,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:04,024 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:39:04,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:04,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:04,025 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:04,025 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:39:04,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:04,025 INFO 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:39:04,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:04,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:04,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-28 10:39:04,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:04,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-28 10:39:04,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:04,193 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:39:04,193 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:04,741 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:39:04,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:04,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2019-02-28 10:39:04,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:04,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-28 10:39:04,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-28 10:39:04,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:39:04,762 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 23 states. [2019-02-28 10:39:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:05,062 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-02-28 10:39:05,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-28 10:39:05,063 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-02-28 10:39:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:05,063 INFO L225 Difference]: With dead ends: 47 [2019-02-28 10:39:05,063 INFO L226 Difference]: Without dead ends: 45 [2019-02-28 10:39:05,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 40 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-02-28 10:39:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-28 10:39:05,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-28 10:39:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-28 10:39:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-02-28 10:39:05,081 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2019-02-28 10:39:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:05,081 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-02-28 10:39:05,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-28 10:39:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-02-28 10:39:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-28 10:39:05,082 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:05,082 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-02-28 10:39:05,082 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:05,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:05,082 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 30 times [2019-02-28 10:39:05,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:05,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:05,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:05,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:05,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:06,161 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:39:06,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:06,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:06,162 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:06,162 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:39:06,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:06,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:06,172 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:06,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:06,197 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:06,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:06,199 WARN L254 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-28 10:39:06,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:07,260 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:39:07,261 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:07,266 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:07,266 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:39:07,328 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:39:07,328 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:07,382 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:39:07,383 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:07,384 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:07,395 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:07,395 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:39:08,586 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:39:08,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:08,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23, 23] total 86 [2019-02-28 10:39:08,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:08,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-28 10:39:08,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-28 10:39:08,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1010, Invalid=6300, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:39:08,607 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 65 states. [2019-02-28 10:39:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:12,187 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-02-28 10:39:12,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-28 10:39:12,188 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 44 [2019-02-28 10:39:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:12,189 INFO L225 Difference]: With dead ends: 71 [2019-02-28 10:39:12,189 INFO L226 Difference]: Without dead ends: 47 [2019-02-28 10:39:12,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1663, Invalid=10547, Unknown=0, NotChecked=0, Total=12210 [2019-02-28 10:39:12,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-28 10:39:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-28 10:39:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-28 10:39:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-02-28 10:39:12,212 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-02-28 10:39:12,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:12,212 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-02-28 10:39:12,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-28 10:39:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-02-28 10:39:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-28 10:39:12,213 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:12,213 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-02-28 10:39:12,213 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:12,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:12,214 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 31 times [2019-02-28 10:39:12,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:12,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:12,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:12,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:12,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:14,203 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:39:14,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:14,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:14,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:14,204 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:39:14,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:14,204 INFO 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:39:14,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:14,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:14,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 98 conjunts are in the unsatisfiable core [2019-02-28 10:39:14,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:15,629 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:39:15,629 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:15,634 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:15,634 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:39:15,699 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:39:15,699 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:15,702 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:39:15,702 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:15,708 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:15,710 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:15,710 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:39:16,099 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:39:16,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:16,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2019-02-28 10:39:16,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:16,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-28 10:39:16,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-28 10:39:16,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:39:16,120 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 70 states. [2019-02-28 10:39:19,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:19,196 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-02-28 10:39:19,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-28 10:39:19,196 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 46 [2019-02-28 10:39:19,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:19,197 INFO L225 Difference]: With dead ends: 72 [2019-02-28 10:39:19,197 INFO L226 Difference]: Without dead ends: 48 [2019-02-28 10:39:19,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 51 SyntacticMatches, 16 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:39:19,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-28 10:39:19,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-02-28 10:39:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-28 10:39:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-02-28 10:39:19,216 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2019-02-28 10:39:19,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:19,216 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-02-28 10:39:19,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-28 10:39:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-02-28 10:39:19,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-28 10:39:19,217 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:19,217 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1] [2019-02-28 10:39:19,217 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:19,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:19,217 INFO L82 PathProgramCache]: Analyzing trace with hash 259355244, now seen corresponding path program 32 times [2019-02-28 10:39:19,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:19,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:19,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:19,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:19,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:19,889 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:39:19,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:19,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:19,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:19,889 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:39:19,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:19,889 INFO 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:39:19,899 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:19,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:19,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-28 10:39:19,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:19,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-28 10:39:19,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:19,994 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:39:19,994 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:20,382 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:39:20,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:20,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2019-02-28 10:39:20,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:20,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-28 10:39:20,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-28 10:39:20,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-02-28 10:39:20,402 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 25 states. [2019-02-28 10:39:20,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:20,793 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-02-28 10:39:20,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-28 10:39:20,793 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-02-28 10:39:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:20,794 INFO L225 Difference]: With dead ends: 51 [2019-02-28 10:39:20,794 INFO L226 Difference]: Without dead ends: 49 [2019-02-28 10:39:20,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 71 SyntacticMatches, 44 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2019-02-28 10:39:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-28 10:39:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-28 10:39:20,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-28 10:39:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-02-28 10:39:20,814 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2019-02-28 10:39:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:20,814 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-02-28 10:39:20,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-28 10:39:20,814 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-02-28 10:39:20,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-28 10:39:20,815 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:20,815 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-02-28 10:39:20,815 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:20,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:20,815 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 33 times [2019-02-28 10:39:20,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:20,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:20,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:20,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:20,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:22,229 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:39:22,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:22,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:22,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:22,229 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:39:22,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:22,230 INFO 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:39:22,238 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:22,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:22,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:22,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:22,279 WARN L254 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 102 conjunts are in the unsatisfiable core [2019-02-28 10:39:22,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:23,527 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:39:23,527 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:23,536 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:23,536 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:39:23,603 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:39:23,603 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:23,665 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:39:23,665 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:23,667 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:23,676 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:23,677 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:39:25,417 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:39:25,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:25,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 25, 25] total 94 [2019-02-28 10:39:25,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:25,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-28 10:39:25,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-28 10:39:25,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1198, Invalid=7544, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:39:25,438 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 71 states. [2019-02-28 10:39:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:29,314 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-02-28 10:39:29,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-28 10:39:29,314 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 48 [2019-02-28 10:39:29,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:29,315 INFO L225 Difference]: With dead ends: 77 [2019-02-28 10:39:29,315 INFO L226 Difference]: Without dead ends: 51 [2019-02-28 10:39:29,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1957, Invalid=12563, Unknown=0, NotChecked=0, Total=14520 [2019-02-28 10:39:29,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-28 10:39:29,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-28 10:39:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-28 10:39:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-02-28 10:39:29,336 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-02-28 10:39:29,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:29,336 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-02-28 10:39:29,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-28 10:39:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-02-28 10:39:29,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-28 10:39:29,337 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:29,337 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-02-28 10:39:29,337 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:29,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:29,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 34 times [2019-02-28 10:39:29,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:29,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:29,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:29,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:29,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:31,064 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:39:31,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:31,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:31,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:31,065 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:39:31,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:31,065 INFO 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:39:31,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:31,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:31,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-28 10:39:31,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:32,515 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:39:32,515 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:32,519 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:32,519 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:39:32,585 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:39:32,586 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:32,588 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:39:32,588 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:32,589 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:32,592 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:32,592 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:39:33,084 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:39:33,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:33,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 75 [2019-02-28 10:39:33,103 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:33,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-28 10:39:33,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-28 10:39:33,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5477, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:39:33,104 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 76 states. [2019-02-28 10:39:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:36,256 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-02-28 10:39:36,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-28 10:39:36,257 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 50 [2019-02-28 10:39:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:36,257 INFO L225 Difference]: With dead ends: 78 [2019-02-28 10:39:36,258 INFO L226 Difference]: Without dead ends: 52 [2019-02-28 10:39:36,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 55 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=472, Invalid=9830, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:39:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-28 10:39:36,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-02-28 10:39:36,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-28 10:39:36,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-02-28 10:39:36,281 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-02-28 10:39:36,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:36,281 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-02-28 10:39:36,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-28 10:39:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-02-28 10:39:36,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-28 10:39:36,282 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:36,282 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1] [2019-02-28 10:39:36,282 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:36,282 INFO L82 PathProgramCache]: Analyzing trace with hash -596041908, now seen corresponding path program 35 times [2019-02-28 10:39:36,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:36,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:36,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:36,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:36,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:36,890 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:39:36,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:36,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:36,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:36,891 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:39:36,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:36,891 INFO 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:39:36,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:36,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:37,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-28 10:39:37,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:37,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-28 10:39:37,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:37,017 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:39:37,017 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:37,474 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:39:37,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:37,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2019-02-28 10:39:37,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:37,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-28 10:39:37,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-28 10:39:37,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-02-28 10:39:37,496 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 27 states. [2019-02-28 10:39:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:37,893 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-02-28 10:39:37,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-28 10:39:37,894 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-02-28 10:39:37,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:37,894 INFO L225 Difference]: With dead ends: 55 [2019-02-28 10:39:37,894 INFO L226 Difference]: Without dead ends: 53 [2019-02-28 10:39:37,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 48 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-02-28 10:39:37,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-28 10:39:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-28 10:39:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-28 10:39:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-02-28 10:39:37,919 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 51 [2019-02-28 10:39:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:37,919 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-02-28 10:39:37,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-28 10:39:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-02-28 10:39:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-28 10:39:37,920 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:37,920 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-02-28 10:39:37,920 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:37,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 36 times [2019-02-28 10:39:37,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:37,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:37,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:37,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:37,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:39,581 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:39:39,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:39,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:39,582 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:39,582 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:39:39,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:39,582 INFO 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:39:39,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:39,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:39,619 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:39,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:39,621 WARN L254 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 110 conjunts are in the unsatisfiable core [2019-02-28 10:39:39,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:41,389 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:39:41,390 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:41,394 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:41,394 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:39:41,468 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:39:41,468 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:41,535 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:39:41,535 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:41,537 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:41,546 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:41,546 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:39:43,191 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:39:43,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:43,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 27, 27] total 102 [2019-02-28 10:39:43,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:43,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-28 10:39:43,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-28 10:39:43,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1402, Invalid=8900, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:39:43,212 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 77 states. [2019-02-28 10:39:47,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:47,632 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-02-28 10:39:47,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-28 10:39:47,632 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 52 [2019-02-28 10:39:47,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:47,633 INFO L225 Difference]: With dead ends: 83 [2019-02-28 10:39:47,633 INFO L226 Difference]: Without dead ends: 55 [2019-02-28 10:39:47,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2275, Invalid=14755, Unknown=0, NotChecked=0, Total=17030 [2019-02-28 10:39:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-28 10:39:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-28 10:39:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-28 10:39:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-02-28 10:39:47,665 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-02-28 10:39:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:47,666 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-02-28 10:39:47,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-28 10:39:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-02-28 10:39:47,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-28 10:39:47,666 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:47,666 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-02-28 10:39:47,667 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:47,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:47,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 37 times [2019-02-28 10:39:47,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:47,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:47,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:47,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:47,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:49,277 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:39:49,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:49,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:49,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:49,278 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:39:49,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:49,278 INFO 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:39:49,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:49,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:49,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 114 conjunts are in the unsatisfiable core [2019-02-28 10:39:49,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:51,315 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:39:51,315 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:51,319 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:51,319 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:39:51,393 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:39:51,393 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:51,396 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:39:51,396 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:51,397 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:51,400 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:51,400 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:39:51,996 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:39:52,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:52,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 81 [2019-02-28 10:39:52,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:52,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-28 10:39:52,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-28 10:39:52,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:39:52,017 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 82 states. [2019-02-28 10:39:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:56,183 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-02-28 10:39:56,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-28 10:39:56,184 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 54 [2019-02-28 10:39:56,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:56,184 INFO L225 Difference]: With dead ends: 84 [2019-02-28 10:39:56,185 INFO L226 Difference]: Without dead ends: 56 [2019-02-28 10:39:56,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 59 SyntacticMatches, 20 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:39:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-28 10:39:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-02-28 10:39:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-28 10:39:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-02-28 10:39:56,209 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2019-02-28 10:39:56,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:56,209 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-02-28 10:39:56,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-28 10:39:56,210 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-02-28 10:39:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-28 10:39:56,210 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:56,210 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1] [2019-02-28 10:39:56,210 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:56,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:56,211 INFO L82 PathProgramCache]: Analyzing trace with hash 488997932, now seen corresponding path program 38 times [2019-02-28 10:39:56,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:56,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:56,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:56,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:56,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:57,070 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:39:57,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:57,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:57,070 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:57,070 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:39:57,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:57,071 INFO 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:39:57,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:57,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:57,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-28 10:39:57,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:57,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-28 10:39:57,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:57,204 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:39:57,204 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:57,922 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:39:57,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:57,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2019-02-28 10:39:57,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:57,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-28 10:39:57,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-28 10:39:57,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-02-28 10:39:57,948 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 29 states. [2019-02-28 10:39:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:58,437 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-02-28 10:39:58,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-28 10:39:58,438 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-02-28 10:39:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:58,439 INFO L225 Difference]: With dead ends: 59 [2019-02-28 10:39:58,439 INFO L226 Difference]: Without dead ends: 57 [2019-02-28 10:39:58,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 83 SyntacticMatches, 52 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2019-02-28 10:39:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-28 10:39:58,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-28 10:39:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-28 10:39:58,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-02-28 10:39:58,464 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 55 [2019-02-28 10:39:58,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:58,464 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-02-28 10:39:58,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-28 10:39:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-02-28 10:39:58,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-28 10:39:58,465 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:58,465 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-02-28 10:39:58,466 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:58,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:58,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 39 times [2019-02-28 10:39:58,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:58,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:58,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:58,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:58,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:01,004 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:40:01,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:01,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:01,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:01,005 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:40:01,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:01,005 INFO 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:40:01,014 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:40:01,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:40:01,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:40:01,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:01,053 WARN L254 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 118 conjunts are in the unsatisfiable core [2019-02-28 10:40:01,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:03,054 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:40:03,054 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:03,060 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:03,060 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:40:03,137 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:40:03,138 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:03,228 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:40:03,229 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:03,231 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:03,241 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:03,241 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:40:05,309 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:40:05,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:05,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 29, 29] total 110 [2019-02-28 10:40:05,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:05,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-28 10:40:05,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-28 10:40:05,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=10368, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:40:05,329 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 83 states. [2019-02-28 10:40:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:10,803 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-02-28 10:40:10,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-28 10:40:10,804 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 56 [2019-02-28 10:40:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:10,804 INFO L225 Difference]: With dead ends: 89 [2019-02-28 10:40:10,804 INFO L226 Difference]: Without dead ends: 59 [2019-02-28 10:40:10,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=2617, Invalid=17123, Unknown=0, NotChecked=0, Total=19740 [2019-02-28 10:40:10,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-28 10:40:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-28 10:40:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-28 10:40:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-02-28 10:40:10,831 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-02-28 10:40:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:10,831 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-02-28 10:40:10,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-28 10:40:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-02-28 10:40:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-28 10:40:10,832 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:10,832 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-02-28 10:40:10,832 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:10,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:10,832 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 40 times [2019-02-28 10:40:10,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:10,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:10,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:10,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:10,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:12,523 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:40:12,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:12,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:12,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:12,524 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:40:12,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:12,524 INFO 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:40:12,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:12,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:40:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:12,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 122 conjunts are in the unsatisfiable core [2019-02-28 10:40:12,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:14,451 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:40:14,451 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:14,457 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:14,458 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:40:14,535 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:40:14,535 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:14,537 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:40:14,538 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:14,539 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:14,542 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:14,542 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:40:15,268 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:40:15,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:15,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 87 [2019-02-28 10:40:15,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:15,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-28 10:40:15,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-28 10:40:15,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=7397, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:40:15,288 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 88 states. [2019-02-28 10:40:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:19,979 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-02-28 10:40:19,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-28 10:40:19,980 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 58 [2019-02-28 10:40:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:19,980 INFO L225 Difference]: With dead ends: 90 [2019-02-28 10:40:19,981 INFO L226 Difference]: Without dead ends: 60 [2019-02-28 10:40:19,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 63 SyntacticMatches, 22 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=548, Invalid=13258, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:40:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-28 10:40:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-02-28 10:40:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-28 10:40:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-02-28 10:40:20,009 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2019-02-28 10:40:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:20,009 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-02-28 10:40:20,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-28 10:40:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-02-28 10:40:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-28 10:40:20,010 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:20,010 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1] [2019-02-28 10:40:20,010 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:20,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:20,010 INFO L82 PathProgramCache]: Analyzing trace with hash -998989556, now seen corresponding path program 41 times [2019-02-28 10:40:20,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:20,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:20,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:20,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:20,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:20,446 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:40:20,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:20,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:20,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:20,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:40:20,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:20,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 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:40:20,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:40:20,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:40:20,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-28 10:40:20,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:20,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-28 10:40:20,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:20,604 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:40:20,605 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:21,515 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:40:21,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:21,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2019-02-28 10:40:21,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:21,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-28 10:40:21,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-28 10:40:21,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-02-28 10:40:21,536 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 31 states. [2019-02-28 10:40:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:22,038 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-02-28 10:40:22,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-28 10:40:22,038 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-02-28 10:40:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:22,039 INFO L225 Difference]: With dead ends: 63 [2019-02-28 10:40:22,039 INFO L226 Difference]: Without dead ends: 61 [2019-02-28 10:40:22,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 89 SyntacticMatches, 56 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-02-28 10:40:22,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-28 10:40:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-28 10:40:22,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-28 10:40:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-02-28 10:40:22,068 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2019-02-28 10:40:22,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:22,069 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-02-28 10:40:22,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-28 10:40:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-02-28 10:40:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-28 10:40:22,069 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:22,069 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-02-28 10:40:22,069 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:22,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:22,070 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 42 times [2019-02-28 10:40:22,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:22,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:22,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:22,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:22,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:23,980 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:40:23,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:23,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:23,980 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:23,980 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:40:23,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:23,980 INFO 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:40:23,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:40:23,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:40:24,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:40:24,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:24,032 WARN L254 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 126 conjunts are in the unsatisfiable core [2019-02-28 10:40:24,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:25,967 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:40:25,967 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:25,972 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:25,973 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:40:26,114 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:40:26,114 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:26,296 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:40:26,297 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:26,299 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:26,311 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:26,312 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:40:28,584 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:40:28,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:28,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 31, 31] total 118 [2019-02-28 10:40:28,605 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:28,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-28 10:40:28,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-28 10:40:28,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=11948, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:40:28,606 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 89 states. [2019-02-28 10:40:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:33,988 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2019-02-28 10:40:33,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-28 10:40:33,989 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 60 [2019-02-28 10:40:33,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:33,990 INFO L225 Difference]: With dead ends: 95 [2019-02-28 10:40:33,990 INFO L226 Difference]: Without dead ends: 63 [2019-02-28 10:40:33,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2983, Invalid=19667, Unknown=0, NotChecked=0, Total=22650 [2019-02-28 10:40:33,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-28 10:40:34,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-28 10:40:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-28 10:40:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-02-28 10:40:34,021 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-02-28 10:40:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:34,021 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-02-28 10:40:34,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-28 10:40:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-02-28 10:40:34,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-28 10:40:34,021 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:34,022 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-02-28 10:40:34,022 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:34,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:34,022 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 43 times [2019-02-28 10:40:34,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:34,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:34,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:34,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:34,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:35,905 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:40:35,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:35,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:35,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:35,906 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:40:35,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:35,906 INFO 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:40:35,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:35,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:40:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:35,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 130 conjunts are in the unsatisfiable core [2019-02-28 10:40:35,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:38,227 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:40:38,227 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:38,231 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:38,232 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:40:38,314 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:40:38,314 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:38,318 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:40:38,318 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:38,319 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:38,321 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:38,321 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:40:39,172 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:40:39,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:39,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 93 [2019-02-28 10:40:39,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:39,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-28 10:40:39,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-28 10:40:39,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=8465, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:40:39,194 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 94 states. [2019-02-28 10:40:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:44,398 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-02-28 10:40:44,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-28 10:40:44,399 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 62 [2019-02-28 10:40:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:44,400 INFO L225 Difference]: With dead ends: 96 [2019-02-28 10:40:44,400 INFO L226 Difference]: Without dead ends: 64 [2019-02-28 10:40:44,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 24 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=586, Invalid=15164, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:40:44,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-28 10:40:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-02-28 10:40:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-28 10:40:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-02-28 10:40:44,430 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-02-28 10:40:44,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:44,431 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-02-28 10:40:44,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-28 10:40:44,431 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-02-28 10:40:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-28 10:40:44,431 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:44,432 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1] [2019-02-28 10:40:44,432 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:44,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:44,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1965001236, now seen corresponding path program 44 times [2019-02-28 10:40:44,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:44,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:44,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:44,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:44,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:46,304 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:40:46,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:46,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:46,304 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:46,304 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:40:46,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:46,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:40:46,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:40:46,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:40:46,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-28 10:40:46,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:46,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-28 10:40:46,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:46,482 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:40:46,482 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:47,572 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:40:47,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:47,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2019-02-28 10:40:47,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:47,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-28 10:40:47,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-28 10:40:47,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-02-28 10:40:47,592 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 33 states. [2019-02-28 10:40:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:48,140 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-02-28 10:40:48,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-28 10:40:48,140 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-02-28 10:40:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:48,141 INFO L225 Difference]: With dead ends: 67 [2019-02-28 10:40:48,141 INFO L226 Difference]: Without dead ends: 65 [2019-02-28 10:40:48,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 95 SyntacticMatches, 60 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-02-28 10:40:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-28 10:40:48,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-28 10:40:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-28 10:40:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-02-28 10:40:48,173 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 63 [2019-02-28 10:40:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:48,173 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-02-28 10:40:48,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-28 10:40:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-02-28 10:40:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-28 10:40:48,173 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:48,174 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-02-28 10:40:48,174 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:48,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:48,174 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 45 times [2019-02-28 10:40:48,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:48,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:48,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:48,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:48,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:51,363 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:40:51,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:51,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:51,363 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:51,363 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:40:51,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:51,363 INFO 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:40:51,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:40:51,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:40:51,410 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:40:51,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:51,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 134 conjunts are in the unsatisfiable core [2019-02-28 10:40:51,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:54,031 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:40:54,032 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:54,036 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:54,036 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:40:54,127 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:40:54,127 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:54,202 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:40:54,203 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:54,204 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:54,215 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:54,215 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:40:56,917 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:40:56,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:56,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 33, 33] total 126 [2019-02-28 10:40:56,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:56,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-28 10:40:56,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-28 10:40:56,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2110, Invalid=13640, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:40:56,939 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 95 states. [2019-02-28 10:41:03,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:03,359 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2019-02-28 10:41:03,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-28 10:41:03,360 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 64 [2019-02-28 10:41:03,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:03,360 INFO L225 Difference]: With dead ends: 101 [2019-02-28 10:41:03,361 INFO L226 Difference]: Without dead ends: 67 [2019-02-28 10:41:03,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=3373, Invalid=22387, Unknown=0, NotChecked=0, Total=25760 [2019-02-28 10:41:03,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-28 10:41:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-28 10:41:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-28 10:41:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-02-28 10:41:03,394 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-02-28 10:41:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:03,395 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-02-28 10:41:03,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-28 10:41:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-02-28 10:41:03,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-28 10:41:03,395 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:03,395 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-02-28 10:41:03,395 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:03,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:03,396 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 46 times [2019-02-28 10:41:03,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:03,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:03,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:03,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:03,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:05,865 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:41:05,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:05,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:05,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:05,865 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:41:05,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:05,866 INFO 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:41:05,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:05,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:41:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:05,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 138 conjunts are in the unsatisfiable core [2019-02-28 10:41:05,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:08,552 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:41:08,553 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:08,558 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:08,558 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:41:08,645 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:41:08,646 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:08,648 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:41:08,648 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:08,649 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:08,651 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:08,651 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:41:09,643 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:41:09,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:09,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 99 [2019-02-28 10:41:09,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:09,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-28 10:41:09,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-28 10:41:09,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:41:09,663 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 100 states. [2019-02-28 10:41:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:14,633 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-02-28 10:41:14,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-28 10:41:14,634 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 66 [2019-02-28 10:41:14,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:14,634 INFO L225 Difference]: With dead ends: 102 [2019-02-28 10:41:14,635 INFO L226 Difference]: Without dead ends: 68 [2019-02-28 10:41:14,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 72 SyntacticMatches, 25 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:41:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-28 10:41:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-02-28 10:41:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-28 10:41:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-02-28 10:41:14,669 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2019-02-28 10:41:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:14,669 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-02-28 10:41:14,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-28 10:41:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-02-28 10:41:14,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-28 10:41:14,669 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:14,670 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1] [2019-02-28 10:41:14,670 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:14,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1906113844, now seen corresponding path program 47 times [2019-02-28 10:41:14,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:14,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:14,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:15,317 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:41:15,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:15,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:15,318 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:15,318 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:41:15,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:15,318 INFO 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:41:15,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:41:15,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:41:15,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-28 10:41:15,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:15,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 66 conjunts are in the unsatisfiable core [2019-02-28 10:41:15,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:15,568 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:41:15,568 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:16,357 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:41:16,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:16,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2019-02-28 10:41:16,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:16,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-28 10:41:16,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-28 10:41:16,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-02-28 10:41:16,377 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 35 states. [2019-02-28 10:41:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:17,015 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-02-28 10:41:17,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-28 10:41:17,015 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-02-28 10:41:17,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:17,016 INFO L225 Difference]: With dead ends: 71 [2019-02-28 10:41:17,016 INFO L226 Difference]: Without dead ends: 69 [2019-02-28 10:41:17,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 64 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-02-28 10:41:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-28 10:41:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-28 10:41:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-28 10:41:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-02-28 10:41:17,065 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 67 [2019-02-28 10:41:17,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:17,066 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-02-28 10:41:17,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-28 10:41:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-02-28 10:41:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-28 10:41:17,066 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:17,066 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-02-28 10:41:17,067 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:17,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:17,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 48 times [2019-02-28 10:41:17,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:17,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:17,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:17,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:17,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:20,630 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:41:20,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:20,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:20,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:20,630 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:41:20,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:20,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:41:20,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:41:20,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:41:20,682 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:41:20,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:20,685 WARN L254 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 142 conjunts are in the unsatisfiable core [2019-02-28 10:41:20,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:23,492 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:41:23,492 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:23,497 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:23,497 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:41:23,593 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:41:23,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:23,677 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:41:23,677 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:23,678 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:23,690 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:23,691 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:41:26,587 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:41:26,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:26,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 35, 35] total 134 [2019-02-28 10:41:26,616 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:26,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-28 10:41:26,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-28 10:41:26,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2378, Invalid=15444, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:41:26,618 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 101 states. [2019-02-28 10:41:34,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:34,599 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2019-02-28 10:41:34,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-28 10:41:34,600 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 68 [2019-02-28 10:41:34,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:34,600 INFO L225 Difference]: With dead ends: 107 [2019-02-28 10:41:34,600 INFO L226 Difference]: Without dead ends: 71 [2019-02-28 10:41:34,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=3787, Invalid=25283, Unknown=0, NotChecked=0, Total=29070 [2019-02-28 10:41:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-28 10:41:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-28 10:41:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-28 10:41:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-02-28 10:41:34,640 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-02-28 10:41:34,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:34,640 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-02-28 10:41:34,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-28 10:41:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-02-28 10:41:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-28 10:41:34,640 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:34,640 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-02-28 10:41:34,641 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:34,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:34,641 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 49 times [2019-02-28 10:41:34,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:34,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:34,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:34,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:34,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:37,015 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:41:37,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:37,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:37,015 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:37,015 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:41:37,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:37,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:41:37,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:37,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:41:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:37,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 146 conjunts are in the unsatisfiable core [2019-02-28 10:41:37,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:40,008 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:41:40,009 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:40,014 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:40,014 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:41:40,106 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:41:40,106 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:40,108 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:41:40,109 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:40,110 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41: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:41:40,112 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:41:41,140 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:41:41,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:41,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 105 [2019-02-28 10:41:41,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:41,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-28 10:41:41,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-28 10:41:41,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:41:41,173 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 106 states. [2019-02-28 10:41:43,763 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-02-28 10:41:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:48,415 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-02-28 10:41:48,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-28 10:41:48,415 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 70 [2019-02-28 10:41:48,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:48,417 INFO L225 Difference]: With dead ends: 108 [2019-02-28 10:41:48,417 INFO L226 Difference]: Without dead ends: 72 [2019-02-28 10:41:48,418 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:41:48,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-28 10:41:48,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-02-28 10:41:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-28 10:41:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-02-28 10:41:48,455 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2019-02-28 10:41:48,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:48,456 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-02-28 10:41:48,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-28 10:41:48,456 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-02-28 10:41:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-28 10:41:48,456 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:48,456 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1] [2019-02-28 10:41:48,457 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:48,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:48,457 INFO L82 PathProgramCache]: Analyzing trace with hash -227129428, now seen corresponding path program 50 times [2019-02-28 10:41:48,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:48,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:48,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:48,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:48,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:49,951 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:41:49,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:49,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:49,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:49,952 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:41:49,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:49,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:41:49,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:41:49,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:41:50,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-28 10:41:50,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:50,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-28 10:41:50,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:50,169 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:41:50,169 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:51,102 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:41:51,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:51,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2019-02-28 10:41:51,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:51,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-28 10:41:51,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-28 10:41:51,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-02-28 10:41:51,123 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 37 states. [2019-02-28 10:41:51,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:51,809 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-02-28 10:41:51,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-28 10:41:51,809 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-02-28 10:41:51,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:51,810 INFO L225 Difference]: With dead ends: 75 [2019-02-28 10:41:51,810 INFO L226 Difference]: Without dead ends: 73 [2019-02-28 10:41:51,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 107 SyntacticMatches, 68 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-02-28 10:41:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-28 10:41:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-28 10:41:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-28 10:41:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-02-28 10:41:51,849 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2019-02-28 10:41:51,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:51,849 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-02-28 10:41:51,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-28 10:41:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-02-28 10:41:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-28 10:41:51,850 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:51,850 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-02-28 10:41:51,850 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:51,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:51,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 51 times [2019-02-28 10:41:51,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:51,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:51,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:51,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:51,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:54,668 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:41:54,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:54,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:54,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:54,669 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:41:54,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:54,669 INFO 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:41:54,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:41:54,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:41:54,732 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:41:54,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:54,735 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 150 conjunts are in the unsatisfiable core [2019-02-28 10:41:54,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:57,558 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:41:57,559 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:57,565 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:57,565 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:41:57,670 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:41:57,671 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:57,763 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:41:57,763 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:57,765 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:57,777 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:57,777 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:42:01,316 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:42:01,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:01,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 37, 37] total 142 [2019-02-28 10:42:01,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:01,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-28 10:42:01,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-28 10:42:01,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2662, Invalid=17360, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:42:01,337 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 107 states. [2019-02-28 10:42:09,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:09,407 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-02-28 10:42:09,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-02-28 10:42:09,408 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 72 [2019-02-28 10:42:09,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:09,408 INFO L225 Difference]: With dead ends: 113 [2019-02-28 10:42:09,408 INFO L226 Difference]: Without dead ends: 75 [2019-02-28 10:42:09,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=4225, Invalid=28355, Unknown=0, NotChecked=0, Total=32580 [2019-02-28 10:42:09,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-28 10:42:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-28 10:42:09,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-28 10:42:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-02-28 10:42:09,450 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-02-28 10:42:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:09,450 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-02-28 10:42:09,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-28 10:42:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-02-28 10:42:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-28 10:42:09,450 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:09,451 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-02-28 10:42:09,451 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:09,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:09,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 52 times [2019-02-28 10:42:09,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:09,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:09,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:09,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:09,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:14,328 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:42:14,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:14,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:14,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:14,329 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:42:14,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:14,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:42:14,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:14,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:14,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 154 conjunts are in the unsatisfiable core [2019-02-28 10:42:14,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:17,477 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:42:17,477 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:17,481 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:17,481 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:42:17,591 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:42:17,591 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:17,594 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:42:17,595 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:17,596 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:17,599 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:17,600 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:42:18,970 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:42:18,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:18,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 111 [2019-02-28 10:42:18,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:18,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-28 10:42:18,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-28 10:42:18,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=12101, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:42:18,990 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 112 states. [2019-02-28 10:42:25,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:25,801 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-02-28 10:42:25,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-28 10:42:25,801 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 74 [2019-02-28 10:42:25,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:25,802 INFO L225 Difference]: With dead ends: 114 [2019-02-28 10:42:25,802 INFO L226 Difference]: Without dead ends: 76 [2019-02-28 10:42:25,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 83 SyntacticMatches, 26 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3645 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=700, Invalid=21650, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:42:25,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-28 10:42:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-02-28 10:42:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-28 10:42:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-02-28 10:42:25,844 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-02-28 10:42:25,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:25,845 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-02-28 10:42:25,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-28 10:42:25,845 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-02-28 10:42:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-28 10:42:25,845 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:25,845 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1] [2019-02-28 10:42:25,846 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:25,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2146155380, now seen corresponding path program 53 times [2019-02-28 10:42:25,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:25,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:25,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:25,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:25,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:26,887 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:42:26,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:26,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:26,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:26,888 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:42:26,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:26,888 INFO 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:42:26,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:26,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:27,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-28 10:42:27,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:27,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-28 10:42:27,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:27,132 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:42:27,132 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:28,127 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:42:28,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:28,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2019-02-28 10:42:28,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:28,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-28 10:42:28,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-28 10:42:28,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-02-28 10:42:28,149 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 39 states. [2019-02-28 10:42:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:28,871 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-02-28 10:42:28,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-28 10:42:28,871 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-02-28 10:42:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:28,872 INFO L225 Difference]: With dead ends: 79 [2019-02-28 10:42:28,872 INFO L226 Difference]: Without dead ends: 77 [2019-02-28 10:42:28,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 113 SyntacticMatches, 72 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-02-28 10:42:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-28 10:42:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-28 10:42:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:42:28,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-02-28 10:42:28,934 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 75 [2019-02-28 10:42:28,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:28,934 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-02-28 10:42:28,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-28 10:42:28,934 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-02-28 10:42:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-28 10:42:28,934 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:28,935 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-02-28 10:42:28,935 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:28,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:28,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 54 times [2019-02-28 10:42:28,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:28,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:28,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:28,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:28,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:32,638 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:42:32,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:32,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:32,639 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:32,639 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:42:32,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:32,639 INFO 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:42:32,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:32,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:32,693 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:32,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:32,696 WARN L254 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 158 conjunts are in the unsatisfiable core [2019-02-28 10:42:32,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:35,884 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:42:35,884 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:35,890 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:35,890 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:42:36,001 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:42:36,002 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:36,094 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:42:36,095 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:36,096 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:36,106 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:36,106 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:42:39,957 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:42:39,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:39,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 39, 39] total 150 [2019-02-28 10:42:39,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:39,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-28 10:42:39,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-28 10:42:39,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2962, Invalid=19388, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:42:39,978 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 113 states. [2019-02-28 10:42:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:49,344 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2019-02-28 10:42:49,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-02-28 10:42:49,344 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 76 [2019-02-28 10:42:49,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:49,345 INFO L225 Difference]: With dead ends: 119 [2019-02-28 10:42:49,345 INFO L226 Difference]: Without dead ends: 79 [2019-02-28 10:42:49,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=4687, Invalid=31603, Unknown=0, NotChecked=0, Total=36290 [2019-02-28 10:42:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-28 10:42:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-28 10:42:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-28 10:42:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-02-28 10:42:49,410 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-02-28 10:42:49,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:49,410 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-02-28 10:42:49,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-28 10:42:49,410 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-02-28 10:42:49,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-28 10:42:49,411 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:49,411 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-02-28 10:42:49,411 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:49,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:49,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 55 times [2019-02-28 10:42:49,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:49,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:49,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:49,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:49,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:53,017 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:42:53,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:53,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:53,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:53,018 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:42:53,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:53,018 INFO 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:42:53,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:53,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:53,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 162 conjunts are in the unsatisfiable core [2019-02-28 10:42:53,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:56,767 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:42:56,767 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:56,773 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:56,774 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:42:56,878 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:42:56,878 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:56,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:42:56,884 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:56,885 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:56,887 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:56,887 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:42:58,138 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:42:58,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:58,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 117 [2019-02-28 10:42:58,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:58,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-28 10:42:58,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-28 10:42:58,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=13457, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:42:58,160 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 118 states. [2019-02-28 10:43:06,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:06,518 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-02-28 10:43:06,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-28 10:43:06,519 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 78 [2019-02-28 10:43:06,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:06,520 INFO L225 Difference]: With dead ends: 120 [2019-02-28 10:43:06,520 INFO L226 Difference]: Without dead ends: 80 [2019-02-28 10:43:06,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 89 SyntacticMatches, 26 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3995 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=738, Invalid=24068, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:43:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-28 10:43:06,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-02-28 10:43:06,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-28 10:43:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-02-28 10:43:06,587 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2019-02-28 10:43:06,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:06,587 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-02-28 10:43:06,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-28 10:43:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-02-28 10:43:06,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-28 10:43:06,588 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:06,588 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1] [2019-02-28 10:43:06,588 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:06,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:06,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1169619308, now seen corresponding path program 56 times [2019-02-28 10:43:06,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:06,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:06,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:06,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:06,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:07,242 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:43:07,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:07,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:07,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:07,243 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:43:07,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:07,243 INFO 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:43:07,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:07,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:07,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-28 10:43:07,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:07,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 78 conjunts are in the unsatisfiable core [2019-02-28 10:43:07,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:07,535 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:43:07,536 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:08,837 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:43:08,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:08,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2019-02-28 10:43:08,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:08,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-28 10:43:08,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-28 10:43:08,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-02-28 10:43:08,858 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 41 states. [2019-02-28 10:43:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:09,696 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-02-28 10:43:09,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-28 10:43:09,696 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-02-28 10:43:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:09,697 INFO L225 Difference]: With dead ends: 83 [2019-02-28 10:43:09,697 INFO L226 Difference]: Without dead ends: 81 [2019-02-28 10:43:09,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 119 SyntacticMatches, 76 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-02-28 10:43:09,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-28 10:43:09,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-28 10:43:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-28 10:43:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-02-28 10:43:09,747 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 79 [2019-02-28 10:43:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:09,747 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-02-28 10:43:09,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-28 10:43:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-02-28 10:43:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-28 10:43:09,748 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:09,748 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-02-28 10:43:09,748 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:09,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:09,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 57 times [2019-02-28 10:43:09,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:09,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:09,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:09,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:09,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:13,034 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:43:13,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:13,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:13,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:13,034 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:43:13,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:13,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:43:13,044 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:13,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:13,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:13,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:13,096 WARN L254 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 166 conjunts are in the unsatisfiable core [2019-02-28 10:43:13,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:17,656 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:43:17,657 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:17,662 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:17,662 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:43:17,775 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:43:17,775 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:17,871 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:43:17,872 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:17,873 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:17,884 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:17,885 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:43:22,180 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:43:22,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:22,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 41, 41] total 158 [2019-02-28 10:43:22,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:22,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-28 10:43:22,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-28 10:43:22,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3278, Invalid=21528, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:43:22,201 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 119 states. [2019-02-28 10:43:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:32,332 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-02-28 10:43:32,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-02-28 10:43:32,332 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 80 [2019-02-28 10:43:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:32,333 INFO L225 Difference]: With dead ends: 125 [2019-02-28 10:43:32,333 INFO L226 Difference]: Without dead ends: 83 [2019-02-28 10:43:32,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=5173, Invalid=35027, Unknown=0, NotChecked=0, Total=40200 [2019-02-28 10:43:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-28 10:43:32,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-28 10:43:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-28 10:43:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-02-28 10:43:32,397 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-02-28 10:43:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:32,397 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-02-28 10:43:32,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-28 10:43:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-02-28 10:43:32,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-28 10:43:32,397 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:32,397 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-02-28 10:43:32,398 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:32,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:32,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 58 times [2019-02-28 10:43:32,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:32,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:32,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:32,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:32,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:35,704 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:43:35,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:35,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:35,705 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:35,705 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:43:35,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:35,705 INFO 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:43:35,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:35,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:35,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 170 conjunts are in the unsatisfiable core [2019-02-28 10:43:35,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:39,398 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:43:39,399 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:39,403 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:39,403 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:43:39,531 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:43:39,531 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:39,533 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:43:39,534 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:39,535 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:39,536 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:39,537 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:43:41,159 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:43:41,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:41,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 123 [2019-02-28 10:43:41,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:41,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-28 10:43:41,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-28 10:43:41,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=14885, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:43:41,180 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 124 states. [2019-02-28 10:43:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:50,054 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2019-02-28 10:43:50,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-28 10:43:50,055 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 82 [2019-02-28 10:43:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:50,056 INFO L225 Difference]: With dead ends: 126 [2019-02-28 10:43:50,056 INFO L226 Difference]: Without dead ends: 84 [2019-02-28 10:43:50,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 93 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4447 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=776, Invalid=26614, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:43:50,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-28 10:43:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-02-28 10:43:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-28 10:43:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-02-28 10:43:50,107 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2019-02-28 10:43:50,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:50,107 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-02-28 10:43:50,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-28 10:43:50,107 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-02-28 10:43:50,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-28 10:43:50,108 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:50,108 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1] [2019-02-28 10:43:50,108 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:50,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:50,109 INFO L82 PathProgramCache]: Analyzing trace with hash 928540236, now seen corresponding path program 59 times [2019-02-28 10:43:50,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:50,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:50,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:50,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:50,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:50,965 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:43:50,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:50,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:50,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:50,966 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:43:50,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:50,966 INFO 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:43:50,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:50,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:51,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-28 10:43:51,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:51,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-28 10:43:51,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:51,263 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:43:51,263 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:52,461 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:43:52,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:52,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2019-02-28 10:43:52,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:52,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-28 10:43:52,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-28 10:43:52,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-02-28 10:43:52,483 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 43 states. [2019-02-28 10:43:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:53,363 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-02-28 10:43:53,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-28 10:43:53,364 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-02-28 10:43:53,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:53,364 INFO L225 Difference]: With dead ends: 87 [2019-02-28 10:43:53,364 INFO L226 Difference]: Without dead ends: 85 [2019-02-28 10:43:53,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 125 SyntacticMatches, 80 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-02-28 10:43:53,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-28 10:43:53,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-28 10:43:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-28 10:43:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-02-28 10:43:53,418 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2019-02-28 10:43:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:53,418 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-02-28 10:43:53,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-28 10:43:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-02-28 10:43:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-28 10:43:53,418 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:53,419 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-02-28 10:43:53,419 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:53,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:53,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 60 times [2019-02-28 10:43:53,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:53,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:53,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:53,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:53,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:56,911 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:43:56,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:56,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:56,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:56,912 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:43:56,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:56,912 INFO 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:43:56,923 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:56,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:56,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:56,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:56,978 WARN L254 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 174 conjunts are in the unsatisfiable core [2019-02-28 10:43:56,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:00,814 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:44:00,815 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:00,819 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:00,819 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:44:00,938 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:44:00,938 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:01,036 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:44:01,037 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:01,038 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:01,050 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:01,050 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:44:05,858 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:44:05,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:05,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 43, 43] total 166 [2019-02-28 10:44:05,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:05,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-02-28 10:44:05,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-02-28 10:44:05,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3610, Invalid=23780, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:44:05,880 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 125 states. [2019-02-28 10:44:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:17,242 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-02-28 10:44:17,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-02-28 10:44:17,243 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 84 [2019-02-28 10:44:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:17,243 INFO L225 Difference]: With dead ends: 131 [2019-02-28 10:44:17,243 INFO L226 Difference]: Without dead ends: 87 [2019-02-28 10:44:17,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=5683, Invalid=38627, Unknown=0, NotChecked=0, Total=44310 [2019-02-28 10:44:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-28 10:44:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-28 10:44:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-28 10:44:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-02-28 10:44:17,306 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-02-28 10:44:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:17,307 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-02-28 10:44:17,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-02-28 10:44:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-02-28 10:44:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-28 10:44:17,307 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:17,307 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-02-28 10:44:17,307 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:17,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:17,308 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 61 times [2019-02-28 10:44:17,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:17,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:17,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:17,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:17,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:20,826 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:44:20,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:20,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:20,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:20,827 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:44:20,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:20,827 INFO 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:44:20,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:20,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:20,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 178 conjunts are in the unsatisfiable core [2019-02-28 10:44:20,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:25,192 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:44:25,192 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:25,197 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:25,197 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:44:25,317 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:44:25,317 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:25,320 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:44:25,320 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:25,321 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:25,324 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:25,324 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:44:27,125 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:44:27,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:27,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 129 [2019-02-28 10:44:27,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:27,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-28 10:44:27,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-28 10:44:27,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=16385, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:44:27,159 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 130 states. [2019-02-28 10:44:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:36,709 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2019-02-28 10:44:36,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-28 10:44:36,709 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 86 [2019-02-28 10:44:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:36,710 INFO L225 Difference]: With dead ends: 132 [2019-02-28 10:44:36,710 INFO L226 Difference]: Without dead ends: 88 [2019-02-28 10:44:36,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 97 SyntacticMatches, 30 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=814, Invalid=29288, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:44:36,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-02-28 10:44:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-02-28 10:44:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-28 10:44:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-02-28 10:44:36,767 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-02-28 10:44:36,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:36,767 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-02-28 10:44:36,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-28 10:44:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-02-28 10:44:36,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-28 10:44:36,768 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:36,768 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1] [2019-02-28 10:44:36,768 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:36,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:36,769 INFO L82 PathProgramCache]: Analyzing trace with hash -831354068, now seen corresponding path program 62 times [2019-02-28 10:44:36,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:36,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:36,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:36,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:36,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:37,924 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:44:37,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:37,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:37,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:37,925 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:44:37,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:37,925 INFO 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:44:37,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:37,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:38,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-28 10:44:38,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:38,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 86 conjunts are in the unsatisfiable core [2019-02-28 10:44:38,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:38,268 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:44:38,268 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:39,582 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:44:39,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:39,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2019-02-28 10:44:39,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:39,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-28 10:44:39,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-28 10:44:39,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-02-28 10:44:39,605 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 45 states. [2019-02-28 10:44:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:40,550 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-02-28 10:44:40,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-28 10:44:40,550 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-02-28 10:44:40,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:40,551 INFO L225 Difference]: With dead ends: 91 [2019-02-28 10:44:40,551 INFO L226 Difference]: Without dead ends: 89 [2019-02-28 10:44:40,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 131 SyntacticMatches, 84 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-02-28 10:44:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-28 10:44:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-28 10:44:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-28 10:44:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-02-28 10:44:40,645 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 87 [2019-02-28 10:44:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:40,645 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-02-28 10:44:40,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-28 10:44:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-02-28 10:44:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-28 10:44:40,646 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:40,646 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-02-28 10:44:40,646 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:40,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:40,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 63 times [2019-02-28 10:44:40,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:40,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:40,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:40,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:40,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:44,667 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:44:44,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:44,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:44,668 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:44,668 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:44:44,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:44,668 INFO 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:44:44,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:44,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:44,731 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:44,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:44,734 WARN L254 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 182 conjunts are in the unsatisfiable core [2019-02-28 10:44:44,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:49,311 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:44:49,311 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:49,317 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:49,318 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:44:49,437 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:44:49,437 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:49,546 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:44:49,546 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:49,547 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:49,559 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:49,559 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:44:54,815 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:44:54,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:54,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 45, 45] total 174 [2019-02-28 10:44:54,834 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:54,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-28 10:44:54,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-28 10:44:54,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3958, Invalid=26144, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:44:54,836 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 131 states. [2019-02-28 10:45:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:08,140 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2019-02-28 10:45:08,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-02-28 10:45:08,140 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 88 [2019-02-28 10:45:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:08,141 INFO L225 Difference]: With dead ends: 137 [2019-02-28 10:45:08,141 INFO L226 Difference]: Without dead ends: 91 [2019-02-28 10:45:08,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=6217, Invalid=42403, Unknown=0, NotChecked=0, Total=48620 [2019-02-28 10:45:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-28 10:45:08,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-28 10:45:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-28 10:45:08,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-02-28 10:45:08,202 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-02-28 10:45:08,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:08,202 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-02-28 10:45:08,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-28 10:45:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-02-28 10:45:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-28 10:45:08,203 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:08,203 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-02-28 10:45:08,203 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:08,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:08,203 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 64 times [2019-02-28 10:45:08,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:08,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:08,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:08,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:08,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:11,910 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:45:11,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:11,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:11,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:11,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:11,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:11,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:45:11,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:11,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:45:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:12,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 186 conjunts are in the unsatisfiable core [2019-02-28 10:45:12,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:16,577 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:45:16,578 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:16,582 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:16,583 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:45:16,728 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:45:16,729 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:16,737 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:45:16,737 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:16,739 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:16,743 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:16,743 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:45:18,808 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:45:18,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:18,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 135 [2019-02-28 10:45:18,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:18,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-28 10:45:18,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-28 10:45:18,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=17957, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:45:18,829 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 136 states. [2019-02-28 10:45:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:29,593 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2019-02-28 10:45:29,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-28 10:45:29,594 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 90 [2019-02-28 10:45:29,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:29,594 INFO L225 Difference]: With dead ends: 138 [2019-02-28 10:45:29,595 INFO L226 Difference]: Without dead ends: 92 [2019-02-28 10:45:29,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 102 SyntacticMatches, 31 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5376 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=852, Invalid=32090, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:45:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-28 10:45:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-02-28 10:45:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-28 10:45:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-02-28 10:45:29,655 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2019-02-28 10:45:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:29,655 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-02-28 10:45:29,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-28 10:45:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-02-28 10:45:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-28 10:45:29,656 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:29,656 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1] [2019-02-28 10:45:29,656 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:29,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:29,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1442879476, now seen corresponding path program 65 times [2019-02-28 10:45:29,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:29,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:29,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:29,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:29,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:30,470 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:45:30,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:30,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:30,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:30,470 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:45:30,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:30,471 INFO 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:45:30,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:45:30,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:45:30,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-28 10:45:30,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:30,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 90 conjunts are in the unsatisfiable core [2019-02-28 10:45:30,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:30,858 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:45:30,859 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:32,463 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:45:32,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:32,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2019-02-28 10:45:32,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:32,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:45:32,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:45:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-02-28 10:45:32,484 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 47 states. [2019-02-28 10:45:33,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:33,726 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-02-28 10:45:33,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-28 10:45:33,726 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-02-28 10:45:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:33,727 INFO L225 Difference]: With dead ends: 95 [2019-02-28 10:45:33,727 INFO L226 Difference]: Without dead ends: 93 [2019-02-28 10:45:33,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 137 SyntacticMatches, 88 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2019-02-28 10:45:33,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-28 10:45:33,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-28 10:45:33,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-28 10:45:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-02-28 10:45:33,788 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 91 [2019-02-28 10:45:33,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:33,788 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-02-28 10:45:33,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:45:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-02-28 10:45:33,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-28 10:45:33,789 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:33,789 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-02-28 10:45:33,789 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:33,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:33,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 66 times [2019-02-28 10:45:33,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:33,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:33,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:33,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:33,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:37,669 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:45:37,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:37,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:37,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:37,670 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:45:37,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:37,670 INFO 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:45:37,678 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:45:37,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:45:37,734 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:45:37,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:37,738 WARN L254 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 190 conjunts are in the unsatisfiable core [2019-02-28 10:45:37,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:42,484 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:45:42,484 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:42,491 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:42,491 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:45:42,621 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:45:42,621 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:42,727 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:45:42,727 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:42,729 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:42,741 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:42,741 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:45:48,356 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:45:48,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:48,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 47, 47] total 182 [2019-02-28 10:45:48,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:48,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-02-28 10:45:48,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-02-28 10:45:48,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4322, Invalid=28620, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:45:48,378 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 137 states. [2019-02-28 10:46:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:01,366 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2019-02-28 10:46:01,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-02-28 10:46:01,367 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 92 [2019-02-28 10:46:01,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:01,368 INFO L225 Difference]: With dead ends: 143 [2019-02-28 10:46:01,368 INFO L226 Difference]: Without dead ends: 95 [2019-02-28 10:46:01,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=6775, Invalid=46355, Unknown=0, NotChecked=0, Total=53130 [2019-02-28 10:46:01,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-28 10:46:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-28 10:46:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-28 10:46:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-02-28 10:46:01,442 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-02-28 10:46:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:01,442 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-02-28 10:46:01,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-02-28 10:46:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-02-28 10:46:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-28 10:46:01,443 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:01,443 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-02-28 10:46:01,443 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:01,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:01,443 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 67 times [2019-02-28 10:46:01,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:01,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:01,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:01,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:01,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:05,848 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:46:05,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:05,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:05,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:05,849 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:46:05,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:05,849 INFO 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:46:05,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:05,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:46:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:05,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 194 conjunts are in the unsatisfiable core [2019-02-28 10:46:05,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:10,834 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:46:10,835 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:10,840 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:10,841 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:46:10,967 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:46:10,968 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:10,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:46:10,973 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:10,974 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:10,977 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:10,977 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:46:12,909 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:46:12,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:12,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 141 [2019-02-28 10:46:12,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:12,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-28 10:46:12,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-28 10:46:12,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=19601, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:46:12,930 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 142 states. [2019-02-28 10:46:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:24,132 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2019-02-28 10:46:24,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-28 10:46:24,132 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 94 [2019-02-28 10:46:24,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:24,133 INFO L225 Difference]: With dead ends: 144 [2019-02-28 10:46:24,133 INFO L226 Difference]: Without dead ends: 96 [2019-02-28 10:46:24,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 106 SyntacticMatches, 33 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5898 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=890, Invalid=35020, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:46:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-02-28 10:46:24,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-02-28 10:46:24,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-28 10:46:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-02-28 10:46:24,199 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2019-02-28 10:46:24,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:24,199 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-02-28 10:46:24,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-28 10:46:24,200 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-02-28 10:46:24,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-28 10:46:24,200 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:24,200 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1] [2019-02-28 10:46:24,200 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:24,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:24,200 INFO L82 PathProgramCache]: Analyzing trace with hash 779681004, now seen corresponding path program 68 times [2019-02-28 10:46:24,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:24,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:24,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:24,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:24,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:25,393 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:46:25,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:25,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:25,394 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:25,394 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:46:25,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:25,394 INFO 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:46:25,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:46:25,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:46:25,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-28 10:46:25,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:25,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-28 10:46:25,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:25,816 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:46:25,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:27,527 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:46:27,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:27,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2019-02-28 10:46:27,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:27,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-28 10:46:27,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-28 10:46:27,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-02-28 10:46:27,548 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 49 states. [2019-02-28 10:46:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:28,609 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-02-28 10:46:28,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-28 10:46:28,610 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-02-28 10:46:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:28,610 INFO L225 Difference]: With dead ends: 99 [2019-02-28 10:46:28,611 INFO L226 Difference]: Without dead ends: 97 [2019-02-28 10:46:28,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 143 SyntacticMatches, 92 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-02-28 10:46:28,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-28 10:46:28,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-28 10:46:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-28 10:46:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-02-28 10:46:28,677 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2019-02-28 10:46:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:28,678 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-02-28 10:46:28,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-28 10:46:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-02-28 10:46:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-28 10:46:28,678 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:28,678 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-02-28 10:46:28,678 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:28,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 69 times [2019-02-28 10:46:28,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:28,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:28,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:28,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:28,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:33,028 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:46:33,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:33,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:33,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:33,029 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:46:33,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:33,029 INFO 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:46:33,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:46:33,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:46:33,098 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:46:33,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:33,102 WARN L254 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 198 conjunts are in the unsatisfiable core [2019-02-28 10:46:33,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:38,383 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:46:38,383 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:38,388 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:38,388 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:46:38,524 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:46:38,525 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:38,639 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:46:38,640 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:38,641 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:38,653 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:38,653 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:46:44,868 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:46:44,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:44,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 49, 49] total 190 [2019-02-28 10:46:44,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:44,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-02-28 10:46:44,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-02-28 10:46:44,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4702, Invalid=31208, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:46:44,889 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 143 states. [2019-02-28 10:46:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:59,517 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2019-02-28 10:46:59,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-02-28 10:46:59,517 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 96 [2019-02-28 10:46:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:59,518 INFO L225 Difference]: With dead ends: 149 [2019-02-28 10:46:59,518 INFO L226 Difference]: Without dead ends: 99 [2019-02-28 10:46:59,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=7357, Invalid=50483, Unknown=0, NotChecked=0, Total=57840 [2019-02-28 10:46:59,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-28 10:46:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-28 10:46:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-28 10:46:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-02-28 10:46:59,588 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-02-28 10:46:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:59,588 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-02-28 10:46:59,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-02-28 10:46:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-02-28 10:46:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-28 10:46:59,588 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:59,588 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-02-28 10:46:59,589 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:59,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:59,589 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 70 times [2019-02-28 10:46:59,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:59,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:59,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:59,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:04,262 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:47:04,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:04,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:04,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:04,263 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:47:04,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:04,263 INFO 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:47:04,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:04,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:47:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:04,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 202 conjunts are in the unsatisfiable core [2019-02-28 10:47:04,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:09,660 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:47:09,660 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:09,665 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:09,665 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:47:09,797 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:47:09,797 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:09,801 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:47:09,801 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:09,802 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:09,805 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:09,805 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:47:12,042 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:47:12,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:12,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 147 [2019-02-28 10:47:12,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:12,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-28 10:47:12,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-28 10:47:12,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=21317, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:47:12,063 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 148 states. [2019-02-28 10:47:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:22,987 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2019-02-28 10:47:22,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-28 10:47:22,987 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 98 [2019-02-28 10:47:22,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:22,988 INFO L225 Difference]: With dead ends: 150 [2019-02-28 10:47:22,988 INFO L226 Difference]: Without dead ends: 100 [2019-02-28 10:47:22,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 110 SyntacticMatches, 35 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6444 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=928, Invalid=38078, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:47:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-28 10:47:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-02-28 10:47:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-28 10:47:23,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-02-28 10:47:23,060 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-02-28 10:47:23,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:23,060 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-02-28 10:47:23,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-28 10:47:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-02-28 10:47:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-28 10:47:23,061 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:23,061 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1] [2019-02-28 10:47:23,061 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:23,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:23,062 INFO L82 PathProgramCache]: Analyzing trace with hash 634997196, now seen corresponding path program 71 times [2019-02-28 10:47:23,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:23,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:23,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:24,058 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:47:24,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:24,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:24,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:24,058 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:47:24,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:24,058 INFO 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:47:24,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:47:24,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:47:24,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-28 10:47:24,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:24,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 98 conjunts are in the unsatisfiable core [2019-02-28 10:47:24,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:24,525 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:47:24,526 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:26,414 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:47:26,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:26,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2019-02-28 10:47:26,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:26,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-28 10:47:26,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-28 10:47:26,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-02-28 10:47:26,436 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 51 states. [2019-02-28 10:47:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:27,584 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-02-28 10:47:27,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-28 10:47:27,584 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-02-28 10:47:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:27,585 INFO L225 Difference]: With dead ends: 103 [2019-02-28 10:47:27,585 INFO L226 Difference]: Without dead ends: 101 [2019-02-28 10:47:27,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 149 SyntacticMatches, 96 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-02-28 10:47:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-28 10:47:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-28 10:47:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-28 10:47:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-02-28 10:47:27,657 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 99 [2019-02-28 10:47:27,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:27,658 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-02-28 10:47:27,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-28 10:47:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-02-28 10:47:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-28 10:47:27,658 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:27,658 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-02-28 10:47:27,658 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:27,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:27,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 72 times [2019-02-28 10:47:27,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:27,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:27,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:27,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:27,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:32,356 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:47:32,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:32,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:32,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:32,356 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:47:32,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:32,356 INFO 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:47:32,377 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:47:32,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:47:32,437 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:47:32,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:32,441 WARN L254 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 206 conjunts are in the unsatisfiable core [2019-02-28 10:47:32,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:38,129 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:47:38,130 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:38,135 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:38,135 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:47:38,276 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:47:38,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:38,393 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:47:38,394 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:38,395 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:38,406 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:38,406 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:47:45,123 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:47:45,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:45,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 51, 51] total 198 [2019-02-28 10:47:45,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:45,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-02-28 10:47:45,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-02-28 10:47:45,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5098, Invalid=33908, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:47:45,145 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 149 states. [2019-02-28 10:48:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:00,698 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2019-02-28 10:48:00,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-02-28 10:48:00,698 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 100 [2019-02-28 10:48:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:00,699 INFO L225 Difference]: With dead ends: 155 [2019-02-28 10:48:00,699 INFO L226 Difference]: Without dead ends: 103 [2019-02-28 10:48:00,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=7963, Invalid=54787, Unknown=0, NotChecked=0, Total=62750 [2019-02-28 10:48:00,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-28 10:48:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-28 10:48:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-28 10:48:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-02-28 10:48:00,775 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-02-28 10:48:00,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:00,775 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-02-28 10:48:00,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-02-28 10:48:00,776 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-02-28 10:48:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-28 10:48:00,776 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:00,776 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-02-28 10:48:00,776 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:00,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:00,776 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 73 times [2019-02-28 10:48:00,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:00,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:00,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:00,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:00,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:05,810 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:48:05,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:05,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:05,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:05,810 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:48:05,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:05,810 INFO 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:48:05,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:05,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:48:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:05,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 210 conjunts are in the unsatisfiable core [2019-02-28 10:48:05,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:11,883 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:48:11,884 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:11,890 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:11,890 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:48:12,069 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:48:12,069 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:12,074 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:48:12,074 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:12,076 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:12,079 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:12,080 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:48:14,540 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:48:14,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:14,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 153 [2019-02-28 10:48:14,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:14,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-28 10:48:14,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-28 10:48:14,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=23105, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:48:14,560 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 154 states. [2019-02-28 10:48:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:26,732 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-02-28 10:48:26,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-28 10:48:26,733 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 102 [2019-02-28 10:48:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:26,734 INFO L225 Difference]: With dead ends: 156 [2019-02-28 10:48:26,734 INFO L226 Difference]: Without dead ends: 104 [2019-02-28 10:48:26,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 114 SyntacticMatches, 37 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7014 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=966, Invalid=41264, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:48:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-28 10:48:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-02-28 10:48:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-28 10:48:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-02-28 10:48:26,810 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2019-02-28 10:48:26,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:26,810 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-02-28 10:48:26,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-28 10:48:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-02-28 10:48:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-28 10:48:26,811 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:26,811 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1] [2019-02-28 10:48:26,811 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:26,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:26,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1603948204, now seen corresponding path program 74 times [2019-02-28 10:48:26,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:26,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:26,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:26,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:26,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:28,107 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:48:28,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:28,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:28,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:28,108 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:48:28,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:28,108 INFO 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:48:28,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:48:28,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:48:28,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-28 10:48:28,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:28,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 102 conjunts are in the unsatisfiable core [2019-02-28 10:48:28,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:28,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:48:28,609 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:30,423 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:48:30,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:30,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-02-28 10:48:30,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:30,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-28 10:48:30,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-28 10:48:30,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-02-28 10:48:30,445 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 53 states. [2019-02-28 10:48:31,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:31,696 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-02-28 10:48:31,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-28 10:48:31,696 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-02-28 10:48:31,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:31,697 INFO L225 Difference]: With dead ends: 107 [2019-02-28 10:48:31,697 INFO L226 Difference]: Without dead ends: 105 [2019-02-28 10:48:31,698 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:48:31,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-28 10:48:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-28 10:48:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-28 10:48:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-02-28 10:48:31,781 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 103 [2019-02-28 10:48:31,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:31,781 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-02-28 10:48:31,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-28 10:48:31,781 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-02-28 10:48:31,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-28 10:48:31,782 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:31,782 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-02-28 10:48:31,782 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:31,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:31,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 75 times [2019-02-28 10:48:31,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:31,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:31,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:31,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:31,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:37,005 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:48:37,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:37,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:37,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:37,006 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:48:37,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:37,006 INFO 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:48:37,015 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:48:37,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:48:37,078 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:48:37,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:37,082 WARN L254 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 214 conjunts are in the unsatisfiable core [2019-02-28 10:48:37,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:43,475 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:48:43,475 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:43,481 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:43,482 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:48:43,630 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:48:43,631 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:43,752 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:48:43,753 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:43,754 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:43,766 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:43,766 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:48:51,043 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:48:51,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:51,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 53, 53] total 206 [2019-02-28 10:48:51,063 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:51,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-02-28 10:48:51,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-02-28 10:48:51,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5510, Invalid=36720, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:48:51,065 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 155 states. [2019-02-28 10:49:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:06,976 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2019-02-28 10:49:06,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-02-28 10:49:06,977 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 104 [2019-02-28 10:49:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:06,978 INFO L225 Difference]: With dead ends: 161 [2019-02-28 10:49:06,978 INFO L226 Difference]: Without dead ends: 107 [2019-02-28 10:49:06,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5458 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=8593, Invalid=59267, Unknown=0, NotChecked=0, Total=67860 [2019-02-28 10:49:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-28 10:49:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-28 10:49:07,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-28 10:49:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-02-28 10:49:07,059 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-02-28 10:49:07,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:07,059 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-02-28 10:49:07,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-02-28 10:49:07,059 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-02-28 10:49:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-28 10:49:07,060 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:07,060 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-02-28 10:49:07,060 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:07,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:07,060 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 76 times [2019-02-28 10:49:07,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:07,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:07,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:07,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:07,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:12,440 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:49:12,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:12,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:12,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:12,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:12,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:12,441 INFO 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:49:12,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:12,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:49:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:12,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 218 conjunts are in the unsatisfiable core [2019-02-28 10:49:12,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:18,885 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:49:18,885 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:18,890 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:18,891 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:49:19,050 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:49:19,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:19,054 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:49:19,055 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:19,056 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:19,058 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:19,058 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-02-28 10:49:21,676 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:49:21,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:21,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 159 [2019-02-28 10:49:21,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:21,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-28 10:49:21,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-28 10:49:21,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=24965, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:49:21,696 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 160 states. [2019-02-28 10:49:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:34,080 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2019-02-28 10:49:34,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-02-28 10:49:34,081 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 106 [2019-02-28 10:49:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:34,081 INFO L225 Difference]: With dead ends: 162 [2019-02-28 10:49:34,081 INFO L226 Difference]: Without dead ends: 108 [2019-02-28 10:49:34,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 118 SyntacticMatches, 39 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7608 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=1004, Invalid=44578, Unknown=0, NotChecked=0, Total=45582 [2019-02-28 10:49:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-28 10:49:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-02-28 10:49:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-28 10:49:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-02-28 10:49:34,165 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2019-02-28 10:49:34,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:34,165 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-02-28 10:49:34,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-28 10:49:34,166 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-02-28 10:49:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-28 10:49:34,166 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:34,166 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1] [2019-02-28 10:49:34,166 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:34,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:34,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1354107788, now seen corresponding path program 77 times [2019-02-28 10:49:34,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:34,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:34,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:34,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:34,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:35,369 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:49:35,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:35,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:35,369 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:35,369 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:49:35,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:35,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:49:35,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:49:35,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:49:35,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-28 10:49:35,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:35,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-28 10:49:35,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:35,921 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:49:35,921 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:37,935 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:49:37,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:37,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2019-02-28 10:49:37,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:37,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-28 10:49:37,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-28 10:49:37,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2019-02-28 10:49:37,958 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 55 states. [2019-02-28 10:49:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:39,462 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2019-02-28 10:49:39,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-28 10:49:39,463 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-02-28 10:49:39,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:39,464 INFO L225 Difference]: With dead ends: 111 [2019-02-28 10:49:39,464 INFO L226 Difference]: Without dead ends: 109 [2019-02-28 10:49:39,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 161 SyntacticMatches, 104 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2019-02-28 10:49:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-28 10:49:39,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-28 10:49:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-28 10:49:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-02-28 10:49:39,551 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2019-02-28 10:49:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:39,551 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-02-28 10:49:39,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-28 10:49:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-02-28 10:49:39,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-28 10:49:39,551 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:39,551 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-02-28 10:49:39,551 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:39,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:39,552 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 78 times [2019-02-28 10:49:39,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:39,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:39,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:39,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:39,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:45,115 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:49:45,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:45,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:45,115 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:45,116 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:49:45,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:45,116 INFO 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:49:45,125 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:49:45,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:49:45,194 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:49:45,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:45,197 WARN L254 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 222 conjunts are in the unsatisfiable core [2019-02-28 10:49:45,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:51,802 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:49:51,802 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:51,806 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:51,807 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-02-28 10:49:51,961 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:49:51,961 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:52,085 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:49:52,085 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:52,087 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:52,097 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:52,098 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-02-28 10:50:00,008 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:50:00,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:00,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 55, 55] total 214 [2019-02-28 10:50:00,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:00,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-02-28 10:50:00,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-02-28 10:50:00,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5938, Invalid=39644, Unknown=0, NotChecked=0, Total=45582 [2019-02-28 10:50:00,030 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 161 states. [2019-02-28 10:50:18,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:18,380 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2019-02-28 10:50:18,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-02-28 10:50:18,380 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 108 [2019-02-28 10:50:18,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:18,381 INFO L225 Difference]: With dead ends: 167 [2019-02-28 10:50:18,381 INFO L226 Difference]: Without dead ends: 111 [2019-02-28 10:50:18,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5884 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=9247, Invalid=63923, Unknown=0, NotChecked=0, Total=73170 [2019-02-28 10:50:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-28 10:50:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-28 10:50:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-28 10:50:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-02-28 10:50:18,468 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-02-28 10:50:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:18,469 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-02-28 10:50:18,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-02-28 10:50:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-02-28 10:50:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-28 10:50:18,469 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:18,469 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-02-28 10:50:18,469 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:50:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:18,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 79 times [2019-02-28 10:50:18,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:18,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:18,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:50:18,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:18,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:24,171 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:50:24,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:24,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:24,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:24,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:24,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:24,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:50:24,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:50:24,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:50:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:24,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 226 conjunts are in the unsatisfiable core [2019-02-28 10:50:24,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:31,135 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:50:31,136 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:31,142 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:31,142 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-02-28 10:50:31,293 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:50:31,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:31,296 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:50:31,296 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:31,297 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:31,300 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:31,300 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5